Pages that link to "Item:Q5892122"
From MaRDI portal
The following pages link to Distributed deterministic edge coloring using bounded neighborhood independence (Q5892122):
Displaying 10 items.
- Near-optimal, distributed edge colouring via the nibble method (Q1274333) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Distributed Graph Coloring: Fundamentals and Recent Developments (Q4980035) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Deterministic distributed edge-coloring with fewer colors (Q5230307) (← links)
- Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity (Q5368959) (← links)
- (Q5687262) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
- Local conflict coloring revisited: Linial for lists (Q6535013) (← links)