Detecting 2-joins faster (Q2376790)

From MaRDI portal
Revision as of 22:13, 2 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59902211, #quickstatements; #temporary_batch_1706897434465)
scientific article
Language Label Description Also known as
English
Detecting 2-joins faster
scientific article

    Statements

    title
    Detecting 2-joins faster (English)
    0 references
    author
    Pierre Charbit
    0 references
    Michel A. Habib
    0 references
    Nicolas Trotignon
    0 references
    Kristina Vušković
    0 references
    publication date
    24 June 2013
    0 references
    zbMATH DE Number
    6180267
    0 references
    zbMATH Keywords
    2-join
    0 references
    edge cutset
    0 references
    detection
    0 references
    closed classes of graphs
    0 references
    induced subgraphs
    0 references
    balanced bipartite graphs
    0 references
    even-hole-free graphs
    0 references
    perfect graphs
    0 references
    claw free graphs
    0 references
    Wikidata QID
    Q59902211
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2376790&oldid=15084411"
    Powered by MediaWiki