An exact exponential time algorithm for counting bipartite cliques.

Konstantin Kutzkov

    Publikation: Artikel i tidsskrift og konference artikel i tidsskriftTidsskriftartikelForskningpeer review

    Abstrakt

    We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.249^n), improving upon known exact algorithms for finding and counting bipartite cliques.
    OriginalsprogEngelsk
    TidsskriftInformation Processing Letters
    Vol/bind112
    Udgave nummer13
    Sider (fra-til)535-539
    Antal sider5
    ISSN0020-0190
    StatusUdgivet - 2012

    Fingeraftryk

    Dyk ned i forskningsemnerne om 'An exact exponential time algorithm for counting bipartite cliques.'. Sammen danner de et unikt fingeraftryk.

    Citationsformater