Large Induced Subgraphs via Triangulations and CMSO (Q2954371)

From MaRDI portal
Revision as of 01:50, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/siamcomp/FominTV15, #quickstatements; #temporary_batch_1731543907597)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Large Induced Subgraphs via Triangulations and CMSO
scientific article

    Statements

    title
    Large Induced Subgraphs via Triangulations and CMSO (English)
    0 references
    author
    Fedor V. Fomin
    0 references
    Ioan Todinca
    0 references
    Yngve Villanger
    0 references
    publication date
    13 January 2017
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    treewidth
    0 references
    potential maximal cliques
    0 references
    minimal triangulations
    0 references
    CMSO
    0 references
    cites work
    (Meta) Kernelization
    0 references
    Induced matchings
    0 references
    Q3077955
    0 references
    Finding induced trees
    0 references
    Q3328583
    0 references
    Q3086928
    0 references
    Q3172385
    0 references
    On cliques in graphs
    0 references
    Q5683627
    0 references

    Identifiers

    DOI
    10.1137/140964801
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C69
    0 references
    68W40
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6674260
    0 references
    Wikidata QID
    Q60488392
    0 references
    OpenAlex ID
    W1968041356
    0 references
    arXiv ID
    1309.1559
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2954371&oldid=37912380"
    Powered by MediaWiki