Carnegie Mellon University
Browse
file.pdf (495.75 kB)

Counting the number of Hamilton cycles in random digraphs

Download (495.75 kB)
journal contribution
posted on 1991-01-01, 00:00 authored by Frieze, Stephen Suen
Abstract: "We show that there exists a a [sic] fully polynomial randomized approximation scheme for counting the number of Hamilton cycles in almost all directed graphs."

History

Publisher Statement

All Rights Reserved

Date

1991-01-01

Usage metrics

    Categories

    Keywords

    Hamiltonian graph theory.Directed graphs.Random graphs.

    Licence

    In Copyright

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC