Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259)

From MaRDI portal
Revision as of 11:08, 3 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
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
scientific article

    Statements

    Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (English)
    0 references
    0 references
    0 references
    10 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    certifying algorithms
    0 references
    path cover
    0 references
    Hamiltonian cycle
    0 references
    interval graphs
    0 references