"ETH Hardness for Densest-k-Subgraph with Perfect Completeness."

Mark Braverman et al. (2017)

> Home

Details and statistics

DOI: 10.1137/1.9781611974782.86

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-02

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/BravermanKRW17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BravermanKRW17
Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein:
ETH Hardness for Densest-k-Subgraph with Perfect Completeness. SODA 2017: 1326-1341

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.