Pages that link to "Item:Q2768357"
From MaRDI portal
The following pages link to Fast distributed graph coloring with \(O(\Delta)\) colors (Q2768357):
Displaying 10 items.
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036) (← links)
- Simple distributed \(\Delta+1\)-coloring of graphs (Q1606946) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- A fast parallel algorithm to color a graph with Δ colors (Q3792256) (← links)
- Locality in Distributed Graph Algorithms (Q3990110) (← links)
- Faster Deterministic Distributed Coloring Through Recursive List Coloring (Q5146848) (← links)
- Euro-Par 2004 Parallel Processing (Q5311346) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)