Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs

DOI10.1007/3-540-60249-6_51OpenAlexW1605272465MaRDI QIDQ5055890FDOQ5055890

Authors: Hristo N. Djidjev, Grammati Pantziou, Christos Zaroliagis 

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60249-6_51

Recommendations

• Improved algorithms for dynamic shortest paths
• Dynamic algorithms for shortest paths in planar graphs
• Single-source shortest paths and strong connectivity in dynamic planar graphs
• scientific article; zbMATH DE number 219245
• Shortest paths in digraphs of small treewidth. I: Sequential algorithms

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Data structures (68P05) Paths and cycles (05C38)

Cites Work

• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Dynamic algorithms for shortest paths in planar graphs
• Planar graph decomposition and all pairs shortest paths
• Shortest path queries in digraphs of small treewidth
• On-line and dynamic algorithms for shortest path problems

Cited In (7)

• Dynamic maintenance of planar digraphs, with applications
• Improved algorithms for dynamic shortest paths
• Faster shortest-path algorithms for planar graphs
• A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs
• Shortest beer path queries in outerplanar graphs
• On-line and dynamic algorithms for shortest path problems
• Efficient algorithms for shortest path queries in planar digraphs

This page was built for publication: Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055890)