ETH hardness for densest-k-Subgraph with perfect completeness
- Mark Braverman
- , Young Kun Ko
- , Aviad Rubinstein
- , Omri Weinstein
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
30
Link opens in a new tab
Scopus
citations