Fully Dynamic 2-Hop Cover Labeling

DOI10.1145/3299901OpenAlexW2912491091WikidataQ128452863 ScholiaQ128452863MaRDI QIDQ4629540

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni

Publication date: 27 March 2019

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3299901

zbMATH Keywords

labelingshortest pathsgraph algorithmsdynamic networksdistance querieslarge graph mining

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Customizable hub labeling: properties and algorithms

Cites Work

• A loop-free shortest-path routing algorithm for dynamic networks
• Dynamic multi-level overlay graphs for shortest paths
• Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings
• Engineering graph-based models for dynamic timetable information systems
• Complex networks: structure and dynamics
• 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
• Hierarchical Hub Labelings for Shortest Paths
• An Experimental Study of Dynamic Dominators
• Robust Distance Queries on Massive Networks
• Statistical mechanics of complex networks
• Fully dynamic update of arc-flags
• Better Approximation of Betweenness Centrality
• Unnamed Item
• Unnamed Item

This page was built for publication: Fully Dynamic 2-Hop Cover Labeling