Fast probabilistic algorithms for Hamiltonian circuits and matchings (Q1141153)

From MaRDI portal
Revision as of 22:06, 13 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast probabilistic algorithms for Hamiltonian circuits and matchings
scientific article

    Statements

    Fast probabilistic algorithms for Hamiltonian circuits and matchings (English)
    0 references
    0 references
    0 references
    1979
    0 references
    probabilistic behaviour
    0 references
    Hamiltonian circuit
    0 references
    random graph
    0 references
    perfect matching
    0 references

    Identifiers