On-line and dynamic algorithms for shortest path problems

DOI10.1007/3-540-59042-0_73zbMath1379.68359OpenAlexW1859866712MaRDI QIDQ4596621

Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_73

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Online algorithms; streaming algorithms (68W27)

Related Items (8)

Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs ⋮ On the computation of fast data transmissions in networks with capacities and delays ⋮ Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Optimal parallel shortest paths in small treewidth digraphs ⋮ Shortest path queries in digraphs of small treewidth ⋮ Transmissions in a network with capacities and delays ⋮ Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms

This page was built for publication: On-line and dynamic algorithms for shortest path problems