All pairs lightest shortest paths

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 61-69

  Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; GRAPH THEORY; PROBLEM SOLVING;

ALL PAIRS LIGHTEST SHORTEST PATHS (APLSP); WEIGHTED DIRECTED GRAPHS;

ALGORITHMS;

EID: 0032687054     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301271     Document Type: Article

References (15)