Dynamic multi-level overlay graphs for shortest paths

DOI10.1007/S11786-007-0023-5MaRDI QIDQ943005zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• 15. Maintenance of multi-level overlay graphs for timetable queries
• Engineering multilevel overlay graphs for shortest-path queries
• Engineering multi-level overlay graphs for shortest-path queries
• Shortest paths on dynamic graphs
• Dynamic algorithms for shortest paths in planar graphs

Cited in

(13)

• A new dynamic graph structure for large-scale transportation networks
• Dynamically maintaining shortest path trees under batches of updates
• Fully Dynamic 2-Hop Cover Labeling
• 15. Maintenance of multi-level overlay graphs for timetable queries
• scientific article; zbMATH DE number 7121837 (Why is no real title available?)
• Engineering multilevel overlay graphs for shortest-path queries
• Engineering multi-level overlay graphs for shortest-path queries
• Minimize the maximum duty in multi-interface networks
• Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
• Engineering graph-based models for dynamic timetable information systems
• Min-max coverage in multi-interface networks
• Distance Queries in Large-Scale Fully Dynamic Complex Networks
• The Shortcut Problem – Complexity and Approximation

This page was built for publication: Dynamic multi-level overlay graphs for shortest paths

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