Bicolored independent sets and bicliques☆
Highlights
► NP-complete graph problems. ► Exact exponential time algorithms. ► Existence and counting problems. ► Bicolored independent sets. ► Bipartite bicliques and non-induced bicliques.
References (19)
- et al.
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics
(2004) - et al.
Complexity of minimum biclique cover and minimum biclique decomposition for bipartite dominofree graphs
Discrete Applied Mathematics
(1998) - et al.
Exact exponential-time algorithms for finding bicliques
Information Processing Letters
(2010) - et al.
On bipartite and multipartite clique problems
Journal of Algorithms
(2001) - et al.
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science
(2005) - et al.
On the generation of bicliques of a graph
Discrete Applied Mathematics
(2007) The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
(2003)Graph Theory
(2010)- H. Fernau, S. Gaspers, D. Kratsch, M. Liedloff, D. Raible, Exact exponential-time algorithms for finding bicliques in a...
There are more references available in the full text version of this article.
Cited by (6)
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
2023, AlgorithmicaNearly optimal average-case complexity of counting bicliques under SETH
2021, Proceedings of the Annual ACM-SIAM Symposium on Discrete AlgorithmsComputing dense and sparse subgraphs of weakly closed graphs
2020, Leibniz International Proceedings in Informatics, LIPIcsThe parameterized complexity of the k-Biclique problem
2018, Journal of the ACMThe parameterized complexity of κ-Biclique
2015, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
- ☆
This work has been supported by ANR under project AGAPE (ANR-09-BLAN-0159-03).
Copyright © 2012 Elsevier B.V. All rights reserved.