Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Amir Nikabadi"'
Autor:
Ramin Javadi, Amir Nikabadi
We present a parameterized dichotomy for the \textsc{$k$-Sparsest Cut} problem in weighted and unweighted versions. In particular, we show that the weighted \textsc{$k$-Sparsest Cut} problem is NP-hard for every $k\geq 3$ even on graphs with bounded
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::655d02aa22ee438e6fa31d4ec94e4d0e
