![](/img/cover-not-exists.png)
The complexity of finding uniform sparsest cuts in various graph classes
Paul Bonsma, Hajo Broersma, Viresh Patel, Artem PyatkinVolume:
14
Year:
2012
Language:
english
Pages:
14
DOI:
10.1016/j.jda.2011.12.008
File:
PDF, 293 KB
english, 2012