Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989)

From MaRDI portal
Revision as of 01:15, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Subexponential-time algorithms for finding large induced sparse subgraphs
scientific article

    Statements

    title
    Subexponential-time algorithms for finding large induced sparse subgraphs (English)
    0 references
    author
    Jana Novotná
    0 references
    Karolina Okrasa
    0 references
    Michał Pilipczuk
    0 references
    Erik Jan van Leeuwen
    0 references
    Bartosz Walczak
    0 references
    Paweł Rzążewski
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 July 2021
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C42
    0 references
    05C60
    0 references
    68Q25
    0 references
    zbMATH DE Number
    7374886
    0 references
    zbMATH Keywords
    subexponential algorithm
    0 references
    feedback vertex set
    0 references
    \(P_t\)-free graphs
    0 references
    string graphs
    0 references
    OpenAlex ID
    W3046548273
    0 references
    arXiv ID
    1910.01082
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2041989&oldid=33448769"
    Powered by MediaWiki