A successful algorithm for solving directed Hamiltonian path problems (Q788642)

From MaRDI portal
Revision as of 17:38, 5 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
A successful algorithm for solving directed Hamiltonian path problems
scientific article

    Statements

    A successful algorithm for solving directed Hamiltonian path problems (English)
    0 references
    0 references
    0 references
    1984
    0 references
    ramification index
    0 references
    graph-theoretic polynomial algorithm
    0 references
    Hamiltonian path
    0 references
    spanning arborescences
    0 references
    Computational experience
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references