"Proportionally dense subgraph of maximum size: Complexity and approximation."

Cristina Bazgan et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2019.07.010

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/BazganCDP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/BazganCDP19
Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau:
Proportionally dense subgraph of maximum size: Complexity and approximation. Discret. Appl. Math. 270: 25-36 (2019)

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.