Exact exponential-time algorithms for finding bicliques (Q1944039)

From MaRDI portal
Revision as of 08:37, 6 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
Exact exponential-time algorithms for finding bicliques
scientific article

    Statements

    title
    Exact exponential-time algorithms for finding bicliques (English)
    0 references
    author
    Daniel Binkele-Raible
    0 references
    Henning Fernau
    0 references
    Serge Gaspers
    0 references
    Mathieu Liedloff
    0 references
    publication date
    4 April 2013
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C69
    0 references
    68W40
    0 references
    zbMATH DE Number
    6150229
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    exact exponential-time algorithms
    0 references
    NP-hard problem
    0 references
    complete bipartite subgraphs
    0 references
    bicliques
    0 references
    OpenAlex ID
    W2136829801
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1944039&oldid=35327931"
    Powered by MediaWiki