Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10331124 | Information Processing Letters | 2014 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Peter Damaschke,