"Finding a Dense Subgraph with Sparse Cut."

Atsushi Miyauchi, Naonori Kakimura (2018)

> Home

Details and statistics

DOI: 10.1145/3269206.3271720

access: closed

type: Conference or Workshop Paper

metadata version: 2020-02-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cikm/MiyauchiK18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cikm/MiyauchiK18
Atsushi Miyauchi, Naonori Kakimura:
Finding a Dense Subgraph with Sparse Cut. CIKM 2018: 547-556

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.