Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993

Volumn , Issue , 1993, Pages 224-229

  MacKenzie, Philip D ^a   Stout, Quentin F ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HAMILTONIANS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

ADJACENCY MATRICES; BREADTH-FIRST; HAMILTONIAN CYCLE; LOWER BOUND TECHNIQUES; MAXIMAL MATCHINGS; PARALLEL COMPLEXITY; PARALLEL CONSTRUCTION; PRAM ALGORITHMS;

GRAPH THEORY;

EID: 4043176604     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/165231.165260     Document Type: Conference Paper

References (11)

1. D. Angluin and L. G. Valiant. Fast probabilistic algorithms for hamiltonian circuits and match-ings. J. Comput. System Sci., 18:155-193, 1979.
2. C. Berge. Graphs and Hypergraphs. North Holland, 1973.
3. B. Bollobâs, T. I. Fenner, and A. M. Frieze. An algorithm for finding hamilton paths and cycles in random graphs. Combinatories, 7(4):327-341, 1987.
4. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, 23:493-507, 1952.
5. A. M. Frieze. Parallel algorithms for finding hamilton cycles in random graphs. Inform. Process. Lett., 25:111-117, 1987.
6. J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proc. 32nd Symp. on Found, of Comp. Sci., pages 698-710, 1991.
7. Y. Gurevich and S. Shelah. Expected computation time for hamiltonian path problem. SIAM J. Comput., 16(3):486-502, 1987.
8. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.
9. P. D. MacKenzie. Load balancing requires fi(logn) expected time. In 3rd ACM-SIAM Symp. on Disc. Alg., pages 94-99, 1992. submitted to SIAM Journal on Computing.
10. Y. Matias and U. Vishkin. Converting high probability into nearly-constant time-with applications to parallel hashing. In Proc. 23rd ACM Symp. on Theory of Computing, pages 307-316, 1991.
11. A. Thomason. A simple linear expected time algorithm for the hamilton cycle problem. Discrete Math., 75:373-379, 1989.