Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament (Q3786504)

From MaRDI portal
Revision as of 14:31, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
scientific article

    Statements

    Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament (English)
    0 references
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithm
    0 references
    directed graph
    0 references
    tournament
    0 references
    Hamiltonian path
    0 references
    strongly connected components
    0 references
    Hamiltonian cycle
    0 references