arXiv (All)
open access
Truly Work-efficient Parallel Deterministic $(Δ+1)$-coloring and Maximal Independent Set
We give deterministic parallel algorithms that compute a $(Δ+1)$-coloring and a maximal independent set for a simple graph with $n$ vertices and $m$ edges in $O(n+m)$ work and $O(\mathrm{poly}\log n)$ depth.
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
- Uniform Sampling of Proper Graph Colorings via Soft Coloring and Partial Rejection Sampling#1117362
- Truly Work-efficient Parallel Deterministic $(Δ+1)$-coloring and Maximal Independent Set#441765
- Rapid Mixing for Sampling Colorings of Random Graphs up to Tree Uniqueness Threshold#1400220
- Fast Distributed $(Δ+ 1)$-Edge Coloring in Bipartite Graphs#1386662
- Fast Distributed $(Δ+ 1)$-Edge Coloring in Bipartite Graphs#1375009
Record · ID 1459225
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