Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633)

From MaRDI portal
Revision as of 05:58, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs
scientific article

    Statements

    title
    Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (English)
    0 references
    author
    Gábor Bacsó
    0 references
    Daniel Lokshtanov
    0 references
    Dániel Marx
    0 references
    Marcin Pilipczuk
    0 references
    Zsolt Tuza
    0 references
    Erik Jan van Leeuwen
    0 references
    published in
    Algorithmica
    0 references
    publication date
    14 February 2019
    0 references
    zbMATH Keywords
    independent set
    0 references
    subexponential algorithms
    0 references
    approximation
    0 references
    scattered set
    0 references
    \(H\)-free graphs
    0 references
    cites work
    Q4634386
    0 references
    Q2721980
    0 references
    Q4511244
    0 references
    Q5749319
    0 references
    Q4886045
    0 references
    Q4904144
    0 references
    Q3002782
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C69
    0 references
    05C35
    0 references
    68Q25
    0 references
    zbMATH DE Number
    7023721
    0 references
    OpenAlex ID
    W2963740725
    0 references
    arXiv ID
    1804.04077
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1725633&oldid=38715176"
    Powered by MediaWiki