View of Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs

##article.return## Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs Download Download PDF