The maximum edge biclique problem is NP-complete.
René PeetersPublished in: Discret. Appl. Math. (2003)
Keyphrases
- np complete
- randomly generated
- np hard
- satisfiability problem
- pspace complete
- edge detection
- edge information
- computational complexity
- polynomial time complexity
- constraint satisfaction problems
- polynomially solvable
- phase transition
- conjunctive queries
- bounded treewidth
- np complete problems
- weighted graph
- undirected graph
- edge map
- search space
- computationally complex
- databases