𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum edge biclique problem is NP-complete

✍ Scribed by René Peeters

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
93 KB
Volume
131
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that the maximum edge biclique problem in bipartite graphs is NP-complete.

📜 SIMILAR VOLUMES

The STO problem is NP-complete
The STO problem is NP-complete
✍ P. Krysta; L. Pacholski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 233 KB

We prove that the problem STO of deciding whether or not a finite set E of term equations is subject to occur-check is in NP. E is subject to occur-check if the execution of the Martelli-Montanari unification algorithm gives for input E a set E ∪ {x = t}, where t = x and x appears in t. Apt et al. (