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

From MaRDI portal
Revision as of 02:14, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    ramification index
    0 references
    graph-theoretic polynomial algorithm
    0 references
    Hamiltonian path
    0 references
    spanning arborescences
    0 references
    Computational experience
    0 references