Highly Influenced

4 Excerpts

@article{Coppersmith1987ParallelGA, title={Parallel graph algorithms that are efficient on average}, author={Don Coppersmith and Prabhakar Raghavan and Martin Tompa}, journal={28th Annual Symposium on Foundations of Computer Science (sfcs 1987)}, year={1987}, pages={260-269} }

- Published in 28th Annual Symposium on Foundations of Computer…1987
DOI:10.1109/SFCS.1987.46

The following three problems concerning random graphs can be solved in (log n)O(1) expected time using linearly many processors: (1) finding the lexicographically first maximal independent set, (2) coloring the vertices using a number of colors that is almost surely within twice the chromatic number, and (3) finding a Hamiltonian circuit.