We have 2 of 58 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
The first $\widetilde O_k(n^{ck})$-time algorithm for Minimum $k$-Cut on simple graphs for an absolute constant $c<1$ is given.
Deterministic expander decomposition, along with replacing vertices by fixed expander graphs to achieve approximate regularity, extends these algorithms to general graphs and evaluates the resulting conditional-expectation scores in two ways.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
