Distance Queries in Large-Scale Fully Dynamic Complex Networks

DOI10.1007/978-3-319-44543-4_9zbMath1478.68062OpenAlexW2521156689MaRDI QIDQ2819495

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

Publication date: 29 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44543-4_9

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (1)

Fully Dynamic 2-Hop Cover Labeling

Cites Work

• Unnamed Item
• Dynamic multi-level overlay graphs for shortest paths
• Complex networks: structure and dynamics
• Hierarchical Hub Labelings for Shortest Paths
• Robust Distance Queries on Massive Networks
• Fully dynamic update of arc-flags

This page was built for publication: Distance Queries in Large-Scale Fully Dynamic Complex Networks