Preeti Malakar, Thomas George, et al.
SC 2012
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.
Preeti Malakar, Thomas George, et al.
SC 2012
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009