A compact routing scheme and approximate distance oracle for power-law graphs

DOI10.1145/2390176.2390180zbMath1301.68026OpenAlexW2152306920WikidataQ114977643 ScholiaQ114977643MaRDI QIDQ2933632

Wei Chen, Yajun Wang, Christian Sommer, Shang-Hua Teng

Publication date: 5 December 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

shortest pathcomplex networkspower-law graphsdistance oracleshortest-path query

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

Shortest-path queries in static networks

This page was built for publication: A compact routing scheme and approximate distance oracle for power-law graphs