Improved algorithms for dynamic shortest paths

DOI10.1007/S004530010043zbMATH0963.68225OpenAlexW2094724468MaRDI QIDQ1586136FDOQ1586136

Authors Hristo N. Djidjev, Grammati Pantziou, Christos Zaroliagis

Publication date 14 November 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004530010043

zbMATH Keywords

planar digraphs

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
• On-line and dynamic algorithms for shortest path problems
• Dynamic algorithms for shortest paths in planar graphs
• scientific article; zbMATH DE number 871917
• scientific article; zbMATH DE number 219245

Cited in

(14)

• On-line and dynamic algorithms for shortest path problems
• Algorithms – ESA 2004
• Efficient algorithms for shortest path queries in planar digraphs
• Exact distance oracles for planar graphs
• Fully dynamic shortest paths in digraphs with arbitrary arc weights
• Upgrading Shortest Paths in Networks
• A special case the of dynamization problem for least cost paths
• Improvements for the thresh X2 shortest path algorithm
• Dynamic algorithms for shortest paths in planar graphs
• Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
• A dynamic topological sort algorithm for directed acyclic graphs
• Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
• scientific article; zbMATH DE number 1670814 (Why is no real title available?)
• scientific article; zbMATH DE number 219245 (Why is no real title available?)

This page was built for publication: Improved algorithms for dynamic shortest paths

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