Pages that link to "Item:Q1894705"
From MaRDI portal
The following pages link to The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705):
Displaying 25 items.
- A self-stabilizing algorithm to maximal 2-packing with improved complexity (Q436592) (← links)
- \(\Delta \)-list vertex coloring in linear time (Q844167) (← links)
- Deterministic local algorithms, unique identifiers, and fractional graph colouring (Q896700) (← links)
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Local nature of Brooks' colouring for degree 3 graphs (Q1423503) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- An experimental analysis of simple, distributed vertex coloring algorithms (Q1763143) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Almost global problems in the LOCAL model (Q1981631) (← links)
- Local mending (Q2097329) (← links)
- Local coloring: new observations and new reductions (Q2327086) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees (Q2390286) (← links)
- Brooks Coloring in Parallel (Q3031926) (← links)
- Locality in Distributed Graph Algorithms (Q3990110) (← links)
- Vaught’s conjecture and the Glimm-Effros property for Polish transformation groups (Q4243619) (← links)
- Fast Distributed Algorithms for Brooks–Vizing Colorings (Q4512574) (← links)
- (Q5090456) (← links)
- Almost global problems in the LOCAL model (Q5090898) (← links)
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs (Q5092380) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- An efficient distributed algorithm for constructing small dominating sets (Q5138380) (← links)
- Improved Distributed Delta-Coloring (Q5197708) (← links)
- Distance edge coloring and collision‐free communication in wireless sensor networks (Q5326804) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)
