Pages that link to "Item:Q5176216"
From MaRDI portal
The following pages link to Deterministic distributed vertex coloring in polylogarithmic time (Q5176216):
Displaying 17 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)
- Vertex coloring with communication and local memory constraints in synchronous broadcast networks (Q1629936) (← links)
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model (Q1660925) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
- Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Q3460717) (← links)
- Multipath Spanners via Fault-Tolerant Spanners (Q4916037) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Polylogarithmic-time deterministic network decomposition and distributed derandomization (Q5144922) (← links)
- Faster Deterministic Distributed Coloring Through Recursive List Coloring (Q5146848) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Coloring fast without learning your neighbors' colors (Q6535038) (← links)
