The hierarchical hub labeling is non-efficient

DOI10.3103/S0027132215050071zbMath1331.05187OpenAlexW1936004807MaRDI QIDQ255772

R. A. Savchenko

Publication date: 9 March 2016

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132215050071

zbMATH Keywords

shortest path problemhub labeling

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Separating Hierarchical and General Hub Labelings
• Hierarchical Hub Labelings for Shortest Paths
• Reachability and Distance Queries via 2-Hop Labels
• Distance labeling in graphs

This page was built for publication: The hierarchical hub labeling is non-efficient