arXiv (OAI Expanded)
open access
Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
The distributed coloring problem is arguably one of the key problems studied in the area of distributed graph algorithms. The most standard variant of the problem asks for a proper vertex coloring of a graph with $Δ+ 1$ colors, where $Δ$ is the maximum degree of the graph. Despite an immense amount
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
- Uniform Sampling of Proper Graph Colorings via Soft Coloring and Partial Rejection Sampling#1117362
- Graph Coloring with Color Preferences#820007
- More Efficient Parallel $(Δ+1)$-Edge Coloring#1130345
- Streaming Hypergraph Coloring via Palette Sparsification#1013660
Record · ID 920237
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive