"The maximum edge biclique problem is NP-complete."

René Peeters (2003)

> Home

Details and statistics

DOI: 10.1016/S0166-218X(03)00333-0

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/Peeters03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Peeters03
René Peeters:
The maximum edge biclique problem is NP-complete. Discret. Appl. Math. 131(3): 651-654 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.