An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964)

From MaRDI portal
Revision as of 22:41, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs
scientific article

    Statements

    An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (English)
    0 references
    0 references
    0 references
    19 February 2011
    0 references
    proper interval graph
    0 references
    perfect graph
    0 references
    path cover
    0 references
    SNIR matrix
    0 references
    linear-time algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references