An exact exponential time algorithm for counting bipartite cliques

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.2491n), improving upon known exact algorithms for finding and counting bipartite cliques. ► Exact exponential time algorithm for counting bipartite cliques. ► A...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 112; číslo 13; s. 535 - 539
Hlavní autor: Kutzkov, Konstantin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 15.07.2012
Elsevier Sequoia S.A
Témata:
Algorithms
Analysis of algorithms
Counting
Counting bipartite cliques
Data processing
Exact exponential time algorithms
Graph theory
Graphs
Running
Studies
Analysis of algorithms
Exact exponential time algorithms
Counting bipartite cliques
ISSN:0020-0190, 1872-6119
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.2491n), improving upon known exact algorithms for finding and counting bipartite cliques. ► Exact exponential time algorithm for counting bipartite cliques. ► A new simplification rule for handling degree-1 vertices. ► Measure & Conquer analysis.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2012.04.001