Nice Labeling Problem for Event Structures: A Counterexample

DOI10.1137/110837760zbMath1281.68161arXiv1107.1207OpenAlexW2130093010WikidataQ124858151 ScholiaQ124858151MaRDI QIDQ3143290

Victor Chepoi

Publication date: 29 November 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.1207

zbMATH Keywords

domainmedian graphCAT(0) cubical complexevent structurebox hypergraphnice labeling

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Medians in median graphs and their cube complexes in linear time ⋮ A compact representation for minimizers of \(k\)-submodular functions ⋮ A counterexample to Thiagarajan's conjecture on regular event structures ⋮ First-order logic axiomatization of metric graph theory ⋮ The simplicial boundary of a CAT(0) cube complex ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ Directed Homotopy in Non-Positively Curved Spaces

This page was built for publication: Nice Labeling Problem for Event Structures: A Counterexample