Separating Hierarchical and General Hub Labelings

DOI10.1007/978-3-642-40313-2_42zbMath1398.68397arXiv1304.5973OpenAlexW1671547709MaRDI QIDQ2849935

Ruslan Savchenko, Ilya Razenshteyn, Andrew V. Goldberg

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.5973

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

On the Complexity of Hub Labeling (Extended Abstract) ⋮ The hierarchical hub labeling is non-efficient

This page was built for publication: Separating Hierarchical and General Hub Labelings