|
Volumn , Issue , 1993, Pages 128-137
|
O(n2) algorithm for circular-arc graph recognition
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL METHODS;
PATTERN RECOGNITION;
CHORADAL BIPARTITE GRAPHS;
CIRCULAR ARC GRAPHS;
GRAPH RECOGNITION ALGORITHMS;
NEIGHBORHOOD CONTAINMENT RELATIONS;
TIME ISOMORPHISM TEST;
GRAPH THEORY;
|
EID: 0027283181
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (44)
|
References (15)
|