The Parameterized Complexity of Graph Cyclability (Q5891809)

From MaRDI portal
Revision as of 14:15, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6695759
Language Label Description Also known as
English
The Parameterized Complexity of Graph Cyclability
scientific article; zbMATH DE number 6695759

    Statements

    title
    The Parameterized Complexity of Graph Cyclability (English)
    0 references
    zbMATH Open document ID
    1425.05033
    0 references
    1358.05077
    0 references
    author
    Petr A. Golovach
    0 references
    Marcin Kaminski
    0 references
    Spyridon Maniatis
    0 references
    Dimitrios M. Thilikos
    0 references
    publication date
    8 October 2014
    0 references
    16 March 2017
    0 references
    Mathematics Subject Classification ID
    05C10
    0 references
    05C38
    0 references
    05C85
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6352774
    0 references
    6695759
    0 references
    OpenAlex ID
    W2963337508
    0 references
    W2591818589
    0 references
    arXiv ID
    1412.3955
    0 references
    zbMATH Keywords
    cyclability
    0 references
    linkages
    0 references
    treewidth
    0 references
    parameterized complexity
    0 references
    cites work
    (Meta) Kernelization
    0 references
    Q4830805
    0 references
    Q3077955
    0 references
    Q3577833
    0 references
    Q4393480
    0 references
    Q4281497
    0 references
    Q4027320
    0 references
    Q5722820
    0 references
    Q4173190
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5891809&oldid=36311367"
    Powered by MediaWiki