A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
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. © 1989.
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976