scientific article; zbMATH DE number 7561659
From MaRDI portal
Publication:5092373
DOI10.4230/LIPIcs.MFCS.2019.15MaRDI QIDQ5092373
Sébastien Ratel, Victor Chepoi, Arnaud Labourel
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs ⋮ Subquadratic-time algorithm for the diameter and all eccentricities on median graphs ⋮ Planar median graphs and cubesquare-graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
- 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
- Median algebras
- Fiber-complemented graphs. I: Structure and invariant subgraphs
- Graphs of some CAT(0) complexes
- Distance and routing labeling schemes for cube-free median graphs
- The geometry and topology of reconfiguration
- An unexpected result in coding the vertices of a graph
- Informative labeling schemes for graphs
- Retracts of hypercubes
- Optimal Distance Labeling for Interval Graphs and Related Graph Families
- Distance and routing labeling schemes for non-positively curved plane graphs
- Implicat Representation of Graphs
- 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
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- A counterexample to Thiagarajan's conjecture on regular event structures
- Optimal Distance Labeling Schemes for Trees
- The complexity of satisfiability problems
This page was built for publication:
