An algorithm for finding all shortest paths using N2.81 infinite-precision multiplications

Information Processing Letters

Volumn 4, Issue 6, 1976, Pages 155-156

  Yuval, G ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

complexity; Shortest paths

Indexed keywords

EID: 0039947721     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(76)90085-5     Document Type: Article

References (4)