Rolf Clauberg
IBM J. Res. Dev
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.
Rolf Clauberg
IBM J. Res. Dev
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
György E. Révész
Theoretical Computer Science
Leo Liberti, James Ostrowski
Journal of Global Optimization