Title of article :
The maximum edge biclique problem is NP-complete
Author/Authors :
René Peeters، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Abstract :
We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.
Keywords :
Complexity , Biclique , Bipartite graphs
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
