"Finding Maximum Edge Bicliques in Convex Bipartite Graphs."

Doron Nussbaum et al. (2012)

> Home

Details and statistics

DOI: 10.1007/S00453-010-9486-X

access: closed

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/NussbaumPSUZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/NussbaumPSUZ12
Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh:
Finding Maximum Edge Bicliques in Convex Bipartite Graphs. Algorithmica 64(2): 311-325 (2012)

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.