The maximum edge biclique problem is NP-complete
Top Cited Papers
- 17 July 2003
- journal article
- research article
- Published by Elsevier
- Vol. 131 (3) , 651-654
- https://doi.org/10.1016/s0166-218x(03)00333-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Bicliques and EigenvaluesJournal of Combinatorial Theory, Series B, 2001
- Bipartite sandwiches: semide?nite relaxations for maximum bicliqueElectronic Notes in Discrete Mathematics, 1999
- Approximating Clique and Biclique ProblemsJournal of Algorithms, 1998
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1987
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Node-and edge-deletion NP-complete problemsPublished by Association for Computing Machinery (ACM) ,1978