Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
Journal article, 2014
We propose an output-sensitive algorithm for the enumeration of all maximal bicliques in a bipartite graph, tailored to the case when the degree distribution in one partite set is very skewed. We accomplish a worst-case bound better than previously known general bounds if, e.g., the degree sequence
follows a power law.
power law
biclique enumeration
degree sequence
hull operator
analysis of algorithms
Author
Peter Damaschke
Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)
Information Processing Letters
0020-0190 (ISSN)
Vol. 114 6 317-321Areas of Advance
Information and Communication Technology
Roots
Basic sciences
Subject Categories
Computer Science
Discrete Mathematics
DOI
10.1016/j.ipl.2014.02.001