Pages that link to "Item:Q4561507"
From MaRDI portal
The following pages link to Distributed (Δ +1)-Coloring in Sublogarithmic Rounds (Q4561507):
Displaying 31 items.
- Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- Simple distributed \(\Delta+1\)-coloring of graphs (Q1606946) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Linial for lists (Q2104037) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- Simple Distributed Δ + 1 Coloring in the SINR Model (Q3460713) (← links)
- Fast Distributed Algorithms for Brooks–Vizing Colorings (Q4512574) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- On the complexity of local distributed graph problems (Q4978023) (← links)
- Distributed Graph Coloring: Fundamentals and Recent Developments (Q4980035) (← links)
- (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
- Neighborhood graphs and distributed Δ+1-coloring (Q5054815) (← links)
- (Q5090456) (← links)
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Some simple distributed algorithms for sparse networks (Q5138354) (← links)
- Deterministic distributed vertex coloring in polylogarithmic time (Q5176216) (← links)
- Improved Distributed Delta-Coloring (Q5197708) (← links)
- Locally-Iterative Distributed (Δ+ 1) (Q5197709) (← links)
- An optimal distributed (Δ+1)-coloring algorithm? (Q5230309) (← links)
- Euro-Par 2004 Parallel Processing (Q5311346) (← links)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees (Q5919420) (← links)
- Making local algorithms wait-free: the case of ring coloring (Q5920224) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- Distributed ∆-coloring plays hide-and-seek (Q6083498) (← links)
- Local conflict coloring revisited: Linial for lists (Q6535013) (← links)
- Distributed computing in the asynchronous LOCAL model (Q6652468) (← links)
