scientific article; zbMATH DE number 1875419
From MaRDI portal
Publication:4796178
zbMATH Open1007.05088MaRDI QIDQ4796178FDOQ4796178
Authors: Andrew V. Goldberg 
Publication date: 2 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610230
Title of this publication is not available (Why is that?)
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cited In (14)
- A Practical Shortest Path Algorithm with Linear Expected Time
- Title not available (Why is that?)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
- A novel pseudo‐polynomial approach for shortest path problems
- STACS 2004
- A spectral approach to the shortest path problem
- Title not available (Why is that?)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
- Via Detours to I/O-Efficient Shortest Paths
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
- Simpler computation of single-source shortest paths in linear average time
- Shortest paths in Euclidean graphs
- Simple linear time approximation algorithm for betweenness
- A faster algorithm for the single source shortest path problem with few distinct positive lengths
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796178)
