Shortest-path problem is not harder than matrix multiplication

Academic Article
Publication Date:
1980
abstract:
No abstract available
Iris type:
01.01 Articolo in rivista
Keywords:
Graph; Diagraph; Matrix multiplicator; Shortest path; Transitive closure
List of contributors:
Handle:
https://iris.cnr.it/handle/20.500.14243/410715
Published in:
INFORMATION PROCESSING LETTERS
Journal