Kernel bounds for path and cycle problems (Q392032)

From MaRDI portal
Revision as of 06:02, 7 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
Kernel bounds for path and cycle problems
scientific article

    Statements

    title
    Kernel bounds for path and cycle problems (English)
    0 references
    author
    Hans L. Bodlaender
    0 references
    Bart M. P. Jansen
    0 references
    Stefan Kratsch
    0 references
    publication date
    13 January 2014
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C38
    0 references
    68Q17
    0 references
    68R10
    0 references
    zbMATH DE Number
    6244633
    0 references
    zbMATH Keywords
    parameterized complexity
    0 references
    kernelization
    0 references
    upper bounds
    0 references
    lower bounds
    0 references
    graphs
    0 references
    path and cycle problems
    0 references
    OpenAlex ID
    W1796863810
    0 references
    Wikidata QID
    Q59567509
    0 references
    cites work
    Color-coding
    0 references
    Q3113681
    0 references
    Q2934608
    0 references
    Q5743378
    0 references
    Q3577833
    0 references
    Q4198056
    0 references
    Q5743381
    0 references
    Q4764626
    0 references
    Divide-and-Color
    0 references
    Q3108579
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q392032&oldid=35367487"
    Powered by MediaWiki