"The Densest Subgraph Problem with a Convex/Concave Size Function."

Yasushi Kawase, Atsushi Miyauchi (2018)

> Home

Details and statistics

DOI: 10.1007/S00453-017-0400-7

access: closed

type: Journal Article

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KawaseM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KawaseM18
Yasushi Kawase, Atsushi Miyauchi:
The Densest Subgraph Problem with a Convex/Concave Size Function. Algorithmica 80(12): 3461-3480 (2018)

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.