The maximum edge biclique problem is NP-complete

René Peeters. The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics, 131(3):651-654, 2003. [doi]

Abstract

Abstract is missing.