Fast Parallel Algorithms for Coloring Random Graphs

Published: 1991, Last Modified: 09 May 2025WG 1991EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We improve here the expected performance of parallel algorithms for graph coloring. This is achieved through new adaptive techniques that may be useful for the average-case analysis of many graph algorithms. We apply our techniques to:
Loading