Frieze, A. M. Parallel algorithms for finding Hamilton cycles in random graphs. (English) Zbl 0653.68071 Inf. Process. Lett. 25, 111-117 (1987). Cited in 4 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 68Q25 Analysis of algorithms and problem complexity 05C80 Random graphs (graph-theoretic aspects) 05C38 Paths and cycles Keywords:Hamilton cycle; parallel algorithm; random graph; dynamic programming × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Bollobás, B.; Fenner, T. I.; Frieze, A. M., An algorithm for finding hamilton cycles in random graphs, (Proc. 17th Ann. ACM Symp. on Theory of Computing (1985)), 430-439 [2] Fortune, S.; Wyllie, J., Parallelism in random access machines, (Proc. 11th Ann. ACM Symp. on Theory of Computing (1978)), 114-118 · Zbl 1282.68104 [3] Y. Gurevich and S. Shelah, Expected computation time for hamilton path problems, SIAM J. Comput., to appear.; Y. Gurevich and S. Shelah, Expected computation time for hamilton path problems, SIAM J. Comput., to appear. · Zbl 0654.68083 [4] A. Thomason, A simple linear expected time algorithm for the hamilton cycle problem, to appear.; A. Thomason, A simple linear expected time algorithm for the hamilton cycle problem, to appear. · Zbl 0681.05051 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.