Simpler, faster and shorter labels for distances in graphs

DOI10.1137/1.9781611974331.ch25zbMath1410.68272arXiv1504.04498OpenAlexW2952655484MaRDI QIDQ4575602

Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen, Stephen Alstrup

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Better distance labeling for unweighted planar graphs ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Unnamed Item ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Better distance labeling for unweighted planar graphs ⋮ Unnamed Item ⋮ Succinct enumeration of distant vertex pairs ⋮ Isometric Universal Graphs ⋮ Shorter Labeling Schemes for Planar Graphs

This page was built for publication: Simpler, faster and shorter labels for distances in graphs