BIROn - Birkbeck Institutional Research Online

    An algorithm for finding Hamilton cycles in a random graph

    Bollobas, B. and Fenner, Trevor and Frieze, A.M. (1985) An algorithm for finding Hamilton cycles in a random graph. In: Sedgewick, R. (ed.) Proceedings of the 17th Annual ACM Symposium on Theory of Computing. ACM, pp. 430-439. ISBN 9780897911511.

    Full text not available from this repository.

    Abstract

    This paper describes a polynomial time algorithm HAM that searches for Hamilton cycles in undirected graphs. On a random graph its asymptotic probability of success is that of the existence of such a cycle. If all graphs with n vertices are considered equally likely, then using dynamic programming on failure leads to an algorithm with polynomial expected time. Finally, it is used in an algorithm for solving the symmetric bottleneck travelling salesman problem with probability tending to 1, as n tends to ∞.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 22 Mar 2021 20:45
    Last Modified: 22 Mar 2021 20:45
    URI: https://eprints.bbk.ac.uk/id/eprint/43624

    Statistics

    Downloads
    Activity Overview
    0Downloads
    45Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item