Exact exponential-time algorithms for finding bicliques (Q1944039)

From MaRDI portal
Revision as of 16:03, 29 July 2023 by Importer (talk | contribs) (‎Created a new 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

    Exact exponential-time algorithms for finding bicliques (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    exact exponential-time algorithms
    0 references
    NP-hard problem
    0 references
    complete bipartite subgraphs
    0 references
    bicliques
    0 references