All pairs almost shortest paths

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1996, Pages 452-461

  Dor, Dor,it ^a   Halperin, Shay ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING;

ALL PAIRS ALMOST SHORTEST PATHS (APASP); ALL PAIRS SHORTEST PATHS (APSP); BOOLEAN MATRIX MULTIPLICATION;

COMPUTATION THEORY;

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

References (0)