Fingerprint
Dive into the research topics of 'ETH hardness for densest-k-Subgraph with perfect completeness'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
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 › peer-review
28
Scopus
citations