"On solving the densest k-subgraph problem on large graphs."

Renata Sotirov (2020)

> Home

Details and statistics

DOI: 10.1080/10556788.2019.1595620

access: open

type: Journal Article

metadata version: 2022-12-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/oms/Sotirov20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/oms/Sotirov20
Renata Sotirov:
On solving the densest k-subgraph problem on large graphs. Optim. Methods Softw. 35(6): 1160-1178 (2020)

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.