Linear-processor polylog-time algorithm for shortest paths in planar graphs

Annual Symposium on Foundatons of Computer Science (Proceedings)

Volumn , Issue , 1993, Pages 259-270

  Klein, Philip N ^a   Subramanian, Sairam ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING; TREES (MATHEMATICS);

BOUNDED GENUS GRAPHS; DIRECTED PLANAR GRAPHS; OVERLAP GRAPHS; SHORTEST PATH;

ALGORITHMS;

EID: 0027806870     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)