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

From MaRDI portal
Revision as of 23:39, 13 March 2024 by Daniel (talk | contribs) (‎Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710362834424)
scientific article
Language Label Description Also known as
English
The longest path problem is polynomial on cocomparability graphs
scientific article

    Statements

    title
    The longest path problem is polynomial on cocomparability graphs (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    5 March 2013
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C45
    0 references
    05C85
    0 references
    zbMATH DE Number
    6141206
    0 references
    zbMATH Keywords
    longest path problem
    0 references
    cocomparability graphs
    0 references
    permutation graphs
    0 references
    polynomial algorithm
    0 references
    complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1939666&oldid=30863996"
    Powered by MediaWiki