Chromatic subdivision of a simplicial complex

DOI10.4310/HHA.2012.v14.n2.a12zbMath1259.68146OpenAlexW2093310293MaRDI QIDQ1935105

Dmitry N. Kozlov

Publication date: 30 January 2013

Published in: Homology, Homotopy and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/hha.2012.v14.n2.a12

zbMATH Keywords

subdivisiondistributed computingcombinatorial algebraic topologyimmediate snapshot protocol

Mathematics Subject Classification ID

General topology of complexes (57Q05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (15)

Collapsibility of read/write models using discrete Morse theory ⋮ Geometric and combinatorial views on asynchronous computability ⋮ Structure theory of flip graphs with applications to weak symmetry breaking ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ Schlegel Diagram and Optimizable Immediate Snapshot Protocol ⋮ Combinatorics of antiprism triangulations ⋮ Iterated chromatic subdivisions are collapsible ⋮ Subdivision of hypergraphs and their colorings ⋮ Filtered simplicial homology, graph dissimilarity and überhomology ⋮ Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes ⋮ Unnamed Item ⋮ Local \(h\)-vectors of quasi-geometric and barycentric subdivisions ⋮ Topology of the immediate snapshot complexes ⋮ Weak symmetry breaking and abstract simplex paths ⋮ A simplicial complex model for dynamic epistemic logic to study distributed task computability

This page was built for publication: Chromatic subdivision of a simplicial complex