Structure theory of flip graphs with applications to weak symmetry breaking
DOI10.1007/s41468-017-0001-1zbMath1400.68157arXiv1511.00457OpenAlexW2963220706MaRDI QIDQ1659336
Publication date: 15 August 2018
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.00457
distributed computingcombinatorial algebraic topologyprotocol complexeschromatic subdivisionimmediate snapshotsweak symmetry breaking
Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of simplicial complexes (05E45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topology of the immediate snapshot complexes
- All binomial identities are orderable
- New combinatorial topology bounds for renaming: the lower bound
- Chromatic subdivision of a simplicial complex
- Topology of the view complex
- The Read/Write Protocol Complex Is Collapsible
- New combinatorial topology upper and lower bounds for renaming
- The topological structure of asynchronous computability
- Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes
- Counting-Based Impossibility Proofs for Renaming and Set Agreement
- Upper bound on the complexity of solving hard renaming
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- Immediate atomic snapshots and fast renaming
- New combinatorial topology bounds for renaming
- Weak symmetry breaking and abstract simplex paths
- Combinatorial algebraic topology
This page was built for publication: Structure theory of flip graphs with applications to weak symmetry breaking
