Truly Work-efficient Parallel Deterministic $(\Delta+1)$-coloring and Maximal Independent Set

2026-10-27来源 arXiv cs.DCEnglish
arXiv:2608.08296v2 Announce Type: replace-cross Abstract: 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.

原文：https://www.a8q9.cn/en/article/truly-work-efficient-parallel-deterministic-delta-1-coloring-and-maximal-indepen-62673a.html

相关文章