Pages that link to "Item:Q4512574"
From MaRDI portal
The following pages link to Fast Distributed Algorithms for Brooks–Vizing Colorings (Q4512574):
Displaying 8 items.
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- An experimental analysis of simple, distributed vertex coloring algorithms (Q1763143) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces (Q3677786) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- Faster Deterministic Distributed Coloring Through Recursive List Coloring (Q5146848) (← links)
- Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring (Q6083481) (← links)