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

Martin Fürer, Balaji Raghavachari

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations

    Fingerprint

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

    Mathematics

    Engineering & Materials Science