The hierarchical hub labeling is non-efficient

DOI10.3103/S0027132215050071zbMATH Open1331.05187OpenAlexW1936004807MaRDI QIDQ255772FDOQ255772

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

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

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)

Cites Work

• Separating Hierarchical and General Hub Labelings
• Hierarchical Hub Labelings for Shortest Paths
• Title not available (Why is that?)
• Reachability and Distance Queries via 2-Hop Labels
• Distance labeling in graphs

Cited In (1)

• 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)