Author's reply to S. Moran's note on the shortest path problem

DOI10.1016/0020-0190(81)90040-5zbMath0474.68079OpenAlexW2012905893MaRDI QIDQ1158969

Francesco Romani

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90040-5

zbMATH Keywords

reducibilitymatrix multiplicationbitwise complexitytotal arithmetic complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Shortest-path problem is not harder than matrix multiplication
• A note on 'Is shortest path problem not harder than matrix multiplication?'

This page was built for publication: Author's reply to S. Moran's note on the shortest path problem