Distance labeling schemes for cube-free median graphs
From MaRDI portal
Publication:5092373
Recommendations
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 26592 (Why is no real title available?)
- scientific article; zbMATH DE number 1339499 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- A counterexample to Thiagarajan's conjecture on regular event structures
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- An unexpected result in coding the vertices of a graph
- Distance and routing labeling schemes for cube-free median graphs
- Distance and routing labeling schemes for non-positively curved plane graphs
- Distance labeling in graphs
- Distance labeling scheme and split decomposition
- Distance labeling schemes for trees
- Embedding Topological Median Algebras in Products of Dendrons
- Fiber-complemented graphs. I: Structure and invariant subgraphs
- Geometry of the space of phylogenetic trees
- Graphs of some CAT(0) complexes
- Implicat Representation of Graphs
- Informative labeling schemes for graphs
- Localized and compact data-structure for comparability graphs
- Median algebras
- Median graphs and Helly hypergraphs
- Metric graph theory and geometry: a survey
- On cube-free median graphs
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
- Optimal Distance Labeling for Interval Graphs and Related Graph Families
- Optimal distance labeling schemes for trees
- Proof of the squashed cube conjecture
- Proximity-preserving labeling schemes
- Query efficient implementation of graphs of bounded clique-width
- Ramified rectilinear polygons: coordinatization by dendrons
- Retracts of hypercubes
- Simpler, faster and shorter labels for distances in graphs
- The complexity of satisfiability problems
- The geometry and topology of reconfiguration
Cited in
(4)
This page was built for publication: Distance labeling schemes for cube-free median graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092373)