Shorter Labeling Schemes for Planar Graphs
From MaRDI portal
Publication:5146793
DOI10.1137/1.9781611975994.27OpenAlexW4211173638MaRDI QIDQ5146793
Marthe Bonamy, Michał Pilipczuk, Cyril Gavoille
Publication date: 2 February 2021
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.03341
Related Items (16)
Clustered 3-colouring graphs of bounded degree ⋮ Better distance labeling for unweighted planar graphs ⋮ The space complexity of sum labelling ⋮ An improved planar graph product structure theorem ⋮ Separating layered treewidth and row treewidth ⋮ Improved product structure for graphs on surfaces ⋮ The product structure of squaregraphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Unnamed Item ⋮ Two Results on Layered Pathwidth and Linear Layouts ⋮ Better distance labeling for unweighted planar graphs ⋮ The space complexity of sum labelling ⋮ Notes on graph product structure theory ⋮ Isometric Universal Graphs ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ Local certification of graphs with bounded genus
This page was built for publication: Shorter Labeling Schemes for Planar Graphs
