I agree that this site is using cookies. You can find further informations here.
X
Merkliste 
 1 Ergebnisse 
 
1

ETH hardness for densest-k-subgraph with perfect completene..:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Braverman, Mark ; Ko, Young Kun ; Rubinstein, Aviad. - p. 1326-1341 , 2017
Link: https://dl.acm.org/doi/10.5555/3039686.3039772