Shortest path and closure algorithms for banded matrices

DOI10.1016/0020-0190(91)90200-2zbMath0753.05001DBLPjournals/ipl/AllisonDY91OpenAlexW2026630113WikidataQ62654291 ScholiaQ62654291MaRDI QIDQ1183497

C. N. Yee, Lloyd Allison, Trevor I. Dix

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90200-2

zbMATH Keywords

shortest pathbanded matricesband widthnegative cyclesclosure algorithmsNegative distances

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

Shortest path and closure algorithms for banded matrices

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Shortest path and closure algorithms for banded matrices
• Shortcut in the Decomposition Algorithm for Shortest Paths in a Network
• Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network
• A Theorem on Boolean Matrices

This page was built for publication: Shortest path and closure algorithms for banded matrices