Pages that link to "Item:Q2934329"
From MaRDI portal
The following pages link to Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition (Q2934329):
Displayed 8 items.
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)