An exact exponential time algorithm for counting bipartite cliques (Q436594)

From MaRDI portal
Revision as of 11:37, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An exact exponential time algorithm for counting bipartite cliques
scientific article

    Statements

    An exact exponential time algorithm for counting bipartite cliques (English)
    0 references
    0 references
    25 July 2012
    0 references
    analysis of algorithms
    0 references
    exact exponential time algorithms
    0 references
    counting bipartite cliques
    0 references

    Identifiers