Dynamic algorithms for shortest paths in planar graphs
DOI10.1016/0304-3975(93)90328-QzbMATH Open0783.68092OpenAlexW1967389135MaRDI QIDQ685367FDOQ685367
E. Feuerstein, Alberto Marchetti-Spaccamela
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90328-q
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Cites Work
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- A Separator Theorem for Planar Graphs
- Parallel concepts in graph theory
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Title not available (Why is that?)
- Incremental convex planarity testing
- Title not available (Why is that?)
- Incremental algorithms for minimal length paths
- Improved algorithms for dynamic shortest paths
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Algorithms -- ESA '93. 1st annual European symposium Bad Honnef, Germany, September 30 -- October 2, 1993. Proceedings
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
- Semi-dynamic breadth-first search in digraphs
- Lifelong planning \(\text{A}^*\)
- Improved algorithms for dynamic shortest paths
- Shortest path queries in digraphs of small treewidth
- Title not available (Why is that?)
- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Title not available (Why is that?)
- A fully dynamic algorithm for planar
- Semi-dynamic shortest paths and breadth-first search in digraphs
- Faster shortest-path algorithms for planar graphs
- A special case the of dynamization problem for least cost paths
- Incremental algorithms for minimal length paths
- Dynamic expression trees
- Title not available (Why is that?)
- Dynamic multi-level overlay graphs for shortest paths
- Title not available (Why is that?)
This page was built for publication: Dynamic algorithms for shortest paths in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685367)
