The longest path problem is polynomial on cocomparability graphs (Q1939666)

From MaRDI portal
Revision as of 14:16, 16 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
The longest path problem is polynomial on cocomparability graphs
scientific article

    Statements

    The longest path problem is polynomial on cocomparability graphs (English)
    0 references
    0 references
    5 March 2013
    0 references
    longest path problem
    0 references
    cocomparability graphs
    0 references
    permutation graphs
    0 references
    polynomial algorithm
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers