The maximum edge biclique problem is NP-complete
(Q60680123)
article by René Peeters published September 2003 in Discrete Applied Mathematics
article by René Peeters published September 2003 in Discrete Applied Mathematics
Language:
Current Data About
The maximum edge biclique problem is NP-complete
| (P31) |
(Q13442814)
|
||||||||||||||||
| (P304) |
651-654
|
||||||||||||||||
| (P433) |
3
|
||||||||||||||||
| (P478) |
131
|
||||||||||||||||
| (P577) |
+2003-09-00T00:00:00Z
|
||||||||||||||||
| (P921) |
(Q215206)
|
||||||||||||||||
| (P1433) |
(Q5808319)
|
||||||||||||||||
| (P1476) |
"The maximum edge biclique problem is NP-complete" (language: en)
|
||||||||||||||||
| (P2093) |
René Peeters
|
||||||||||||||||
| (P2860) |
(Q29013070)
(Q56209809)
|
||||||||||||||||
| (P6104) |
(Q8487137)
|
other details
| description | article by René Peeters published September 2003 in Discrete Applied Mathematics |
External Links
| (P356) |
10.1016/S0166-218X(03)00333-0
|
| (P894) |
1026.68068
|
| (P8978) |
journals/dam/Peeters03
|