Distance and routing labeling schemes for cube-free median graphs
From MaRDI portal
Publication:2223698
Recommendations
Cites work
- A counterexample to Thiagarajan's conjecture on regular event structures
- A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes
- Algorithms and Computation
- An unexpected result in coding the vertices of a graph
- Bypassing the embedding
- Collective tree spanners in graphs with bounded parameters
- 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
- Distributed Computing: A Locality-Sensitive Approach
- Embedding Topological Median Algebras in Products of Dendrons
- Fiber-complemented graphs. I: Structure and invariant subgraphs
- Forbidden-set distance labels for graphs of bounded doubling dimension
- Geometry of the space of phylogenetic trees
- Graphs of some CAT(0) complexes
- 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 1756017 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 821282 (Why is no real title available?)
- Implicat Representation of Graphs
- Informative labeling schemes for graphs
- Introduction to algorithms.
- Localized and compact data-structure for comparability graphs
- Median algebras
- Median graphs and Helly hypergraphs
- Memory requirement for routing in distributed networks
- Metric graph theory and geometry: a survey
- Nice labeling problem for event structures: a counterexample
- On cube-free median graphs
- On density of subgraphs of Cartesian products
- 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
- Optimal scale-free compact routing schemes in networks of low doubling dimension
- 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
- Shortest path problem in rectangular complexes of global nonpositive curvature
- Simpler, faster and shorter labels for distances in graphs
- Sublinear-space distance labeling using hubs
- The complexity of satisfiability problems
- The geometry and topology of reconfiguration
- The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves and Jason Manning).
Cited in
(7)- Distance labeling schemes for \(K_4\)-free bridged graphs
- Planar median graphs and cubesquare-graphs
- Distance labeling schemes for cube-free median graphs
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs
- Brief announcement: Labeling schemes for power-law graphs
- Sample Compression Schemes for Balls in Graphs
- On cube-free median graphs
This page was built for publication: Distance and routing 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 Q2223698)
