Metraipolis › archive › dc_2edf19c33eee
Truly Work-efficient Parallel Deterministic $(Δ+1)$-coloring and Maximal Independent Set — arXiv:2608.08296
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08296
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T08:52:47.474Z
- SHA-256 of the archived text
59199b52d3212d27dc46201401b2ec01e06fc800ef64f834adf7c78b33af9132- Stable URL of this page
https://metraipolis.com/documento/dc_2edf19c33eee
How to cite
Truly Work-efficient Parallel Deterministic $(Δ+1)$-coloring and Maximal Independent Set — arXiv:2608.08296 — arXiv (en), https://arxiv.org/abs/2608.08296 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2edf19c33eee (Metraipolis archive dc_2edf19c33eee, sha256 59199b52d3212d27dc46201401b2ec01e06fc800ef64f834adf7c78b33af9132)
BibTeX
@misc{dc2edf19c33eee,
title = {Truly Work-efficient Parallel Deterministic $(Δ+1)$-coloring and Maximal Independent Set — arXiv:2608.08296},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08296},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2edf19c33eee; sha256 59199b52d3212d27dc46201401b2ec01e06fc800ef64f834adf7c78b33af9132},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08296. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give deterministic parallel algorithms that compute a $(\Delta+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.
Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-11 in cs.DC).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2608.08296 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T08:50:23.776Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).