Distance and routing labeling schemes for cube-free median graphs
From MaRDI portal
Publication:2223698
DOI10.1007/s00453-020-00756-wOpenAlexW3041586642MaRDI QIDQ2223698
Sébastien Ratel, Victor Chepoi, Arnaud Labourel
Publication date: 1 February 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.10508
Related Items
Sample Compression Schemes for Balls in Graphs, Planar median graphs and cubesquare-graphs, Unnamed Item, Distance labeling schemes for \(K_4\)-free bridged graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves and Jason Manning).
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
- Shortest path problem in rectangular complexes of global nonpositive curvature
- Collective tree spanners in graphs with bounded parameters
- On cube-free median graphs
- Ramified rectilinear polygons: coordinatization by dendrons
- Localized and compact data-structure for comparability graphs
- Proof of the squashed cube conjecture
- Median graphs and Helly hypergraphs
- Query efficient implementation of graphs of bounded clique-width
- Distance labeling scheme and split decomposition
- Geometry of the space of phylogenetic trees
- Sublinear-space distance labeling using hubs
- Median algebras
- Fiber-complemented graphs. I: Structure and invariant subgraphs
- Graphs of some CAT(0) complexes
- A counterexample to Thiagarajan's conjecture on regular event structures
- The geometry and topology of reconfiguration
- An unexpected result in coding the vertices of a graph
- Informative labeling schemes for graphs
- Memory requirement for routing in distributed networks
- Nice Labeling Problem for Event Structures: A Counterexample
- Retracts of hypercubes
- Optimal Distance Labeling for Interval Graphs and Related Graph Families
- Distance and routing labeling schemes for non-positively curved plane graphs
- Bypassing the embedding
- Implicat Representation of Graphs
- Distributed Computing: A Locality-Sensitive Approach
- Simpler, faster and shorter labels for distances in graphs
- Distance labeling schemes for trees
- Embedding Topological Median Algebras in Products of Dendrons
- Distance labeling in graphs
- Proximity-preserving labeling schemes
- Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- On density of subgraphs of Cartesian products
- Optimal Distance Labeling Schemes for Trees
- The complexity of satisfiability problems
- Algorithms and Computation
