Parallel (Δ + 1)-coloring of constant-degree graphs-Reference-Cited by-同舟云学术

Parallel (Δ + 1)-coloring of constant-degree graphs

Author:

Goldberg Andrew V.,Plotkin Serge A.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference8 articles.

1. B. Awerbuch, Private communication, 1986.

3. Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms;Cole,1986

5. Efficient parallel algorithms for (Δ + 1)-coloring and maximal independent set problems;Goldberg,1987

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

3. High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality;SC20: International Conference for High Performance Computing, Networking, Storage and Analysis;2020-11

5. Towards the locality of Vizing’s theorem;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23