Median graphs, parallelism and posets
From MaRDI portal
Publication:686442
DOI10.1016/0012-365X(93)90140-OzbMath0787.05027OpenAlexW2082363232MaRDI QIDQ686442
Julien Constantin, Jean-Pierre Barthelemy
Publication date: 5 January 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90140-o
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Semilattices (06A12)
Related Items
Medians in median graphs and their cube complexes in linear time ⋮ Medians for weight metrics in the covering graphs of semilattices ⋮ A compact representation for minimizers of \(k\)-submodular functions ⋮ Tiled partial cubes ⋮ A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes ⋮ The median procedure on median graphs ⋮ A counterexample to Thiagarajan's conjecture on regular event structures ⋮ Subquadratic-time algorithm for the diameter and all eccentricities on median graphs ⋮ First-order logic axiomatization of metric graph theory ⋮ Shortest paths and convex hulls in 2D complexes with non-positive curvature ⋮ Relating CAT(0) cubical complexes and flag simplicial complexes ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ A nonpositive curvature property of modular semilattices ⋮ A compact representation for modular semilattices and its applications ⋮ A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ A poset-based approach to embedding median graphs in hypercubes and lattices ⋮ A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) ⋮ What Do Trees and Hypercubes Have in Common? ⋮ Directed Homotopy in Non-Positively Curved Spaces ⋮ Enumerating maximal consistent closed sets in closure systems
Cites Work