Edge search number of cographs (Q415273)

From MaRDI portal
Revision as of 05:22, 5 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
Edge search number of cographs
scientific article

    Statements

    title
    Edge search number of cographs (English)
    0 references
    author
    Petr A. Golovach
    0 references
    Pinar Heggernes
    0 references
    Rodica Mihai
    0 references
    publication date
    11 May 2012
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    68P10
    0 references
    zbMATH DE Number
    6033758
    0 references
    zbMATH Keywords
    graph searching
    0 references
    NP-hard problem
    0 references
    polynomial-time algorithm
    0 references
    graph classes
    0 references
    cographs
    0 references
    OpenAlex ID
    W2068664205
    0 references
    cites work
    Q4035355
    0 references
    Q3199182
    0 references
    Q3483321
    0 references
    Q3351169
    0 references
    Searching and pebbling
    0 references
    Q4159394
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q415273&oldid=35277998"
    Powered by MediaWiki