scientific article; zbMATH DE number 7561659

DOI10.4230/LIPICS.MFCS.2019.15MaRDI QIDQ5092373FDOQ5092373

Sébastien Ratel, Victor Chepoi, Arnaud Labourel

Publication date: 21 July 2022

Title of this publication is not available (Why is that?)

zbMATH Keywords

labeling schemesmedian graphsdistributed distance computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Geometry of the space of phylogenetic trees
• Distance labeling in graphs
• Median algebras
• Graphs of some CAT(0) complexes
• The complexity of satisfiability problems
• Retracts of hypercubes
• Optimal Distance Labeling for Interval Graphs and Related Graph Families
• Implicat Representation of Graphs
• An unexpected result in coding the vertices of a graph
• Informative labeling schemes for graphs
• Localized and compact data-structure for comparability graphs
• Fiber-complemented graphs. I: Structure and invariant subgraphs
• Distance labeling scheme and split decomposition
• Proximity-preserving labeling schemes
• Median graphs and Helly hypergraphs
• The geometry and topology of reconfiguration
• On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
• Embedding Topological Median Algebras in Products of Dendrons
• Ramified rectilinear polygons: coordinatization by dendrons
• Query efficient implementation of graphs of bounded clique-width
• On cube-free median graphs
• Proof of the squashed cube conjecture
• Simpler, faster and shorter labels for distances in graphs
• Distance labeling schemes for trees
• Optimal Distance Labeling Schemes for Trees
• Distance and routing labeling schemes for cube-free median graphs
• Distance and routing labeling schemes for non-positively curved plane graphs
• A counterexample to Thiagarajan's conjecture on regular event structures
• A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes

Cited In (4)

• Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
• Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs
• Planar median graphs and cubesquare-graphs
• On cube-free median graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092373)