An efficient parallel algorithm for finding hamiltonian cycles in dense directed graphs

Martin Furer, Balaji Raghavachari

    Research output: Contribution to journalArticlepeer-review

    Abstract

    Let G be a directed graph with n vertices such that whenever there is no arc from any vertex u to another vertex v, then the sum of the outdegree of u and the indegree of v is at least n. It is known that such a graph G always contains a Hamiltonian cycle. We show how to compute a Hamiltonian cycle of G with a linear number of processors in O(log3n) time on a CREW PRAM.

    Original languageEnglish (US)
    Pages (from-to)203-220
    Number of pages18
    JournalJournal of Algorithms
    Volume18
    Issue number2
    DOIs
    StatePublished - Jan 1 1995

    All Science Journal Classification (ASJC) codes

    • Control and Optimization
    • Computational Mathematics
    • Computational Theory and Mathematics

    Fingerprint Dive into the research topics of 'An efficient parallel algorithm for finding hamiltonian cycles in dense directed graphs'. Together they form a unique fingerprint.

    Cite this