Bicolored independent sets and bicliques

Authors:
Jean-François Couturier;Dieter Kratsch
Affiliations:
Laboratoire dInformatique Théorique et Appliquée, Université Paul Verlaine-Metz, 57045 Metz Cedex 01, France;Laboratoire dInformatique Théorique et Appliquée, Université Paul Verlaine-Metz, 57045 Metz Cedex 01, France
Venue:
Information Processing Letters
Year:
2012

Citing 15
Cited 0

Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs

Discrete Applied Mathematics
On bipartite and multipartite clique problems

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Node-and edge-deletion NP-complete problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
The maximum edge biclique problem is NP-complete

Discrete Applied Mathematics
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
On Independent Sets and Bicliques in Graphs

Graph-Theoretic Concepts in Computer Science
On Two Techniques of Combining Branching and Treewidth

Algorithmica
A measure & conquer approach for the analysis of exact algorithms

Journal of the ACM (JACM)
Exact exponential-time algorithms for finding bicliques

Information Processing Letters
Exact Exponential Algorithms

Exact Exponential Algorithms
Counting minimum weighted dominating sets

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We introduce the decision problem Bicolored Independent Set which generalizes the well-known NP-complete graph problem Independent Set. We present an O(1.2691^n) time algorithm solving its counting analogue #Bicolored Independent Set. We show how to use this algorithm to establish algorithms solving biclique counting problems and provide an O(1.2691^n) time algorithm solving #Bipartite Biclique and an O(1.6107^n) time algorithm solving #Non-induced Biclique.