A simple shortest path algorithm with linear average time
From MaRDI portal
Recommendations
- A Practical Shortest Path Algorithm with Linear Expected Time
- STACS 2004
- Simpler computation of single-source shortest paths in linear average time
- Simple linear time approximation algorithm for betweenness
- An algorithm for ranking quickest simple paths
- A simple linear expected time algorithm for finding a Hamilton path
- A novel linear algorithm for shortest paths in networks
- A polynomial-time algorithm to find shortest paths with recourse
- An algorithm for the quickest path problem
- scientific article; zbMATH DE number 4066938
Cited in
(15)- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
- Shortest paths in Euclidean graphs
- Simple linear time approximation algorithm for betweenness
- A spectral approach to the shortest path problem
- Simpler computation of single-source shortest paths in linear average time
- A Practical Shortest Path Algorithm with Linear Expected Time
- Via Detours to I/O-Efficient Shortest Paths
- scientific article; zbMATH DE number 3937196 (Why is no real title available?)
- scientific article; zbMATH DE number 1472109 (Why is no real title available?)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
- STACS 2004
- A novel pseudo‐polynomial approach for shortest path problems
- Exploring monotone priority queues for Dijkstra optimization
- A faster algorithm for the single source shortest path problem with few distinct positive lengths
This page was built for publication: A simple shortest path algorithm with linear average time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796178)
