Parallel algorithms for finding Hamilton cycles in random graphs

Authors:
A. M. Frieze
Affiliations:
-
Venue:
Information Processing Letters
Year:
1987

Citing 0
Cited 2

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
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

Quantified Score

Hi-index	0.89

Visualization

Abstract