Dynamic multi-level overlay graphs for shortest paths

DOI10.1007/s11786-007-0023-5zbMath1158.68053OpenAlexW2051825184MaRDI QIDQ943005

Daniele Frigioni, Gianlorenzo D'Angelo, Serafino Cicerone, Francesco Bruera, Gabriele Di Stefano

Publication date: 8 September 2008

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-007-0023-5

zbMATH Keywords

speed-up techniquesshortest paths algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Unnamed Item, Engineering graph-based models for dynamic timetable information systems, Minimize the maximum duty in multi-interface networks, Fully Dynamic 2-Hop Cover Labeling, The Shortcut Problem – Complexity and Approximation, Min-Max Coverage in Multi-interface Networks, Distance Queries in Large-Scale Fully Dynamic Complex Networks, Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates, Dynamically Maintaining Shortest Path Trees under Batches of Updates