Exact exponential-time algorithms for finding bicliques (Q1944039)

From MaRDI portal
Revision as of 03:20, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references