Optimal Distance Labeling Schemes for Trees

DOI10.1145/3087801.3087804zbMath1380.68312arXiv1608.00212OpenAlexW2963873784MaRDI QIDQ5368961

Paweł Gawrychowski, Oren Weimann, Patrick K. Nicholson, Ofer Freedman

Publication date: 11 October 2017

Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

labeling schemeuniversal tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (10)

Better distance labeling for unweighted planar graphs ⋮ Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs ⋮ Unnamed Item ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Better distance labeling for unweighted planar graphs ⋮ Unnamed Item ⋮ Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games ⋮ Isometric Universal Graphs ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs

This page was built for publication: Optimal Distance Labeling Schemes for Trees