The hierarchical hub labeling is non-efficient

DOI10.3103/S0027132215050071MaRDI QIDQ255772zbMATH OpenOpenAlexFDO

Authors 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

hub labelingshortest path problem

Mathematics Subject Classification ID

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

Recommendations

• Hierarchical hub labelings for shortest paths
• On the complexity of hub labeling (extended abstract)
• Algorithmic and hardness results for the hub labeling problem
• Separating Hierarchical and General Hub Labelings
• Algorithms for hub label optimization

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Distance labeling in graphs
• Hierarchical hub labelings for shortest paths
• Reachability and Distance Queries via 2-Hop Labels
• Separating Hierarchical and General Hub Labelings

Cited in

(2)

• Hierarchical hub labelings for shortest paths
• Separating Hierarchical and General Hub Labelings

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

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