Algorithms for finding disjoint path covers in unit interval graphs (Q266951)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Algorithms for finding disjoint path covers in unit interval graphs
scientific article

    Statements

    Algorithms for finding disjoint path covers in unit interval graphs (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    disjoint path
    0 references
    path cover
    0 references
    path partition
    0 references
    proper interval graph
    0 references
    graph algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references