Abstract
The shortest path problem in a graph is studied using hub labeling. It is proved that a hierarchical hub labeling can be \(\Omega \left( {\sqrt n } \right)\) times larger than the minimal (non-hierarchical) hub labeling.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
