Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Simple and efficient greedy algorithms for hamilton cycles in random intersection graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A distributed algorithm to find hamiltonian cycles in g(np) random graphs
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
| Hi-index | 0.05 |