The maximum edge biclique problem is NP-complete

Discrete Applied Mathematics

Volumn 131, Issue 3, 2003, Pages 651-654

  Peeters, René ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

Biclique; Bipartite graphs; Complexity

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

BICLIQUE PROBLEMS;

GRAPH THEORY;

EID: 0141998079     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00333-0     Document Type: Article

References (8)

1. M. Dawande, P. Keskinocak, S. Tayur, On the biclique problem in bipartite graphs, GSIA Working Paper 1996-04, Carnegie Mellon University, Pittsburgh, PA 15213, USA, 1996.
2. Garey M.R., Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
3. Haemers W.H. Bicliques and eigenvalues. J. Combin. Theory B. 82:2001;56-66.
4. Hochbaum D.S. Approximating clique and biclique problems. J. Algorithms. 29(1):1998;174-200.
5. Johnson D.S. The NP-completeness column. an ongoing guide J. Algorithms. 8(3):1987;438-448.
6. Lovász L. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory. 25:1979;1-7.
7. D.V. Pasechnik, Bipartite sandwiches: bounding the size of a maximum biclique, 1999, preprint.
8. M. Yannakakis, Node- and edge-deletion NP-complete problems, Proceedings of the 10th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1978, pp. 253-264.