Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs

DOI10.1007/978-3-030-54921-3_18OpenAlexW4285713375MaRDI QIDQ5100967

Sébastien Ratel, Arnaud Labourel, Victor Chepoi

Publication date: 1 September 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

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

zbMATH Keywords

bridged graphsdistance labeling schemes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Better distance labeling for unweighted planar graphs
• Simplicial nonpositive curvature
• Localized and compact data-structure for comparability graphs
• On local convexity in graphs
• A Helly theorem in weakly modular space
• Query efficient implementation of graphs of bounded clique-width
• Distance labeling scheme and split decomposition
• Graphs of some CAT(0) complexes
• The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs
• Weakly Modular Graphs and Nonpositive Curvature
• Optimal Distance Labeling for Interval Graphs and Related Graph Families
• Distance and routing labeling schemes for non-positively curved plane graphs
• Conditions for invariance of set diameters under d-convexification in a graph
• Distributed Computing: A Locality-Sensitive Approach
• Distance labeling in graphs
• Optimal Distance Labeling Schemes for Trees
• Compact oracles for reachability and approximate distances in planar digraphs