Shorter Labeling Schemes for Planar Graphs

DOI10.1137/1.9781611975994.27MaRDI QIDQ5146793zbMATH OpenOpenAlexFDO

Authors Marthe Bonamy, Cyril Gavoille, Michał Pilipczuk

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Shorter Labeling Schemes for Planar Graphs
• Adjacency Labelling for Planar Graphs (and Beyond)
• Labeling schemes for bounded degree graphs
• Adjacency labeling schemes and induced-universal graphs
• Adjacency labeling schemes and induced-universal graphs

Cited in

(22)

• Separating layered treewidth and row treewidth
• Local certification of graphs with bounded genus
• Better distance labeling for unweighted planar graphs
• Isometric universal graphs
• The product structure of squaregraphs
• Two results on layered pathwidth and linear layouts
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• Clustered 3-colouring graphs of bounded degree
• Structural properties of graph products
• Short Labels by Traversal and Jumping
• Better distance labeling for unweighted planar graphs
• Improved product structure for graphs on surfaces
• The space complexity of sum labelling
• scientific article; zbMATH DE number 7765385 (Why is no real title available?)
• An improved planar graph product structure theorem
• Universal families of arcs and curves on surfaces
• Shorter Labeling Schemes for Planar Graphs
• Adjacency Labelling for Planar Graphs (and Beyond)
• The space complexity of sum labelling
• Universal geometric graphs
• Notes on graph product structure theory
• Shortcutting Planar Digraphs

This page was built for publication: Shorter Labeling Schemes for Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146793)