Unified all-pairs shortest path algorithms in the chordal hierarchy
From MaRDI portal
Publication:1364781
DOI10.1016/S0166-218X(96)00103-5zbMath0879.05065OpenAlexW1984344831MaRDI QIDQ1364781
Publication date: 28 August 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs ⋮ Diameter determination on restricted graph families
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms for shortest distance queries on special classes of polygons
- Highly parallelizable problems on sorted intervals
- Shortest-path problem is not harder than matrix multiplication
- An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- Doubly lexical ordering of dense 0--1 matrices
- Doubly Lexical Orderings of Matrices
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Recursive Graphs, Recursive Labelings and Shortest Paths
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- Efficient algorithms for solving systems of linear equations and path problems
This page was built for publication: Unified all-pairs shortest path algorithms in the chordal hierarchy
