Improved algorithms for dynamic shortest paths

DOI10.1007/S004530010043zbMATH Open0963.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

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

zbMATH Keywords

planar digraphs

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (12)

• Fully dynamic shortest paths in digraphs with arbitrary arc weights
• Dynamic algorithms for shortest paths in planar graphs
• Improvements for the thresh X2 shortest path algorithm
• Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
• Upgrading Shortest Paths in Networks
• Algorithms – ESA 2004
• Title not available (Why is that?)
• Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs
• A special case the of dynamization problem for least cost paths
• A dynamic topological sort algorithm for directed acyclic graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)