Bicolored independent sets and bicliques

https://doi.org/10.1016/j.ipl.2012.01.010Get rights and content

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.2691n) 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.2691n) time algorithm solving #Bipartite Biclique and an O(1.6107n) time algorithm solving #Non-induced Biclique.

Highlights

► NP-complete graph problems. ► Exact exponential time algorithms. ► Existence and counting problems. ► Bicolored independent sets. ► Bipartite bicliques and non-induced bicliques.

References (19)

There are more references available in the full text version of this article.

Cited by (6)

This work has been supported by ANR under project AGAPE (ANR-09-BLAN-0159-03).

View full text