Distance labeling schemes for \(K_4\)-free bridged graphs

DOI10.1016/j.ic.2022.104959OpenAlexW3045844469MaRDI QIDQ2105446

Victor Chepoi, Sébastien Ratel, Arnaud Labourel

Publication date: 8 December 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2022.104959

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small cancellation theory and automatic groups
• Boundaries of systolic groups.
• Simplicial nonpositive curvature
• Localized and compact data-structure for comparability graphs
• On local convexity in graphs
• On bridged graphs and cop-win graphs
• A Helly theorem in weakly modular space
• On isometric subgraphs of infinite bridged graphs and geodesic convexity
• Bridged graphs are cop-win graphs: An algorithmic proof
• Query efficient implementation of graphs of bounded clique-width
• Distance labeling scheme and split decomposition
• Median problem in some plane triangulations and quadrangulations.
• Decomposition and \(l_1\)-embedding of weakly median graphs
• On infinite bridged graphs and strongly dismantlable graphs
• Graphs of some CAT(0) complexes
• Medians in median graphs and their cube complexes in linear time
• Distance and routing labeling schemes for cube-free median graphs
• Metric systolicity and two-dimensional Artin groups
• The algebra of metric betweenness. II: Geometry and equational characterization of weakly median graphs
• Filling invariants of systolic complexes and groups.
• Graph Theory and Probability
• 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
• The fixed point theorem for simplicial nonpositive curvature
• Isometries of systolic spaces
• Conditions for invariance of set diameters under d-convexification in a graph
• A Construction of Locally Homogeneous Graphs
• Distributed Computing: A Locality-Sensitive Approach
• Two-dimensional systolic complexes satisfy property A
• Distance labeling in graphs
• Large‐type Artin groups are systolic
• Optimal Distance Labeling Schemes for Trees
• Compact oracles for reachability and approximate distances in planar digraphs
• Dismantlability of weakly systolic complexes and applications
• Algorithms and Computation

This page was built for publication: Distance labeling schemes for \(K_4\)-free bridged graphs