The complexity of minimum-length path decompositions (Q494076)

From MaRDI portal
Revision as of 17:30, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of minimum-length path decompositions
scientific article

    Statements

    title
    The complexity of minimum-length path decompositions (English)
    0 references
    author
    Dariusz Dereniowski
    0 references
    Yori Zwols
    0 references
    Wiesław X. Kubiak
    0 references
    publication date
    31 August 2015
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C38
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6476956
    0 references
    zbMATH Keywords
    graph searching
    0 references
    path decomposition
    0 references
    pathwidth
    0 references
    OpenAlex ID
    W2763773774
    0 references
    arXiv ID
    1302.2788
    0 references
    cites work
    Q3113669
    0 references
    Q4035355
    0 references
    Q4218147
    0 references
    Q4198056
    0 references
    Searching and pebbling
    0 references
    Q3477966
    0 references
    Q3836524
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q494076&oldid=36198326"
    Powered by MediaWiki