Enumerating maximal bicliques in bipartite graphs with favorable degree sequences

Authors:
Peter Damaschke
Affiliations:
-
Venue:
Information Processing Letters
Year:
2014

Citing 7
Cited 0

Consensus algorithms for the generation of all maximal bicliques

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Generating bicliques of a graph in lexicographic order

Theoretical Computer Science
On the generation of bicliques of a graph

Discrete Applied Mathematics
Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms

IEEE Transactions on Knowledge and Data Engineering
Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques

BIBM '08 Proceedings of the 2008 IEEE International Conference on Bioinformatics and Biomedicine
Enumeration aspects of maximal cliques and bicliques

Discrete Applied Mathematics
Random texts exhibit Zipf's-law-like word frequency distribution

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.89

Visualization

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.