|
Volumn , Issue , 1992, Pages 431-441
|
Contraction procedure for planar directed graphs
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
PARALLEL PROCESSING SYSTEMS;
PROBABILITY;
TESTING;
TREES (MATHEMATICS);
PLANAR DIRECTED ACYCLIC GRAPHS (DAGS);
POINCARE INDEX FORMULA;
REACHABILITY PROBLEM;
GRAPH THEORY;
|
EID: 0026993242
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (7)
|
References (0)
|