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

From MaRDI portal
Revision as of 15:56, 21 June 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
An exact exponential time algorithm for counting bipartite cliques
scientific article

    Statements

    title
    An exact exponential time algorithm for counting bipartite cliques (English)
    0 references
    author
    Konstantin Kutzkov
    0 references
    publication date
    25 July 2012
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q436594&oldid=498718"
      Powered by MediaWiki