Exact exponential-time algorithms for finding bicliques
- 29 October 2010
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 111 (2) , 64-67
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Independent Sets and Bicliques in GraphsAlgorithmica, 2010
- Constraint bipartite vertex cover: simpler exact algorithms and implementationsJournal of Combinatorial Optimization, 2010
- Generating bicliques of a graph in lexicographic orderTheoretical Computer Science, 2005
- The maximum edge biclique problem is NP-completeDiscrete Applied Mathematics, 2003
- On Bipartite and Multipartite Clique ProblemsJournal of Algorithms, 2001
- An Efficient Exact Algorithm for Constraint Bipartite Vertex CoverJournal of Algorithms, 2001
- Approximating Clique and Biclique ProblemsJournal of Algorithms, 1998
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphsDiscrete Applied Mathematics, 1998
- Efficient Spare Allocation for Reconfigurable ArraysIEEE Design & Test of Computers, 1987
- Node-and edge-deletion NP-complete problems1978