Unified all-pairs shortest path algorithms in the chordal hierarchy
From MaRDI portal
Publication:1364781
DOI10.1016/S0166-218X(96)00103-5zbMATH Open0879.05065OpenAlexW1984344831MaRDI QIDQ1364781FDOQ1364781
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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Doubly lexical ordering of dense 0--1 matrices
- Doubly Lexical Orderings of Matrices
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
- Efficient algorithms for shortest distance queries on special classes of polygons
- Highly parallelizable problems on sorted intervals
- Recursive Graphs, Recursive Labelings and Shortest Paths
- Shortest-path problem is not harder than matrix multiplication
- Efficient algorithms for solving systems of linear equations and path problems
Cited In (4)
This page was built for publication: Unified all-pairs shortest path algorithms in the chordal hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364781)
