Title :
Parallel graph algorithms that are efficient on average
Author :
Coppersmith, Don ; Raghavan, Prabhakar ; Tompa, Martin
Abstract :
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.
Keywords :
Algorithm design and analysis; Circuit analysis computing; Color; Computational modeling; Concurrent computing; H infinity control; Parallel algorithms; Phase change random access memory; Polynomials;
Conference_Titel :
Foundations of Computer Science, 1987., 28th Annual Symposium on
Conference_Location :
Los Angeles, CA, USA
Print_ISBN :
0-8186-0807-2
DOI :
10.1109/SFCS.1987.46
