The complexity of finding uniform sparsest cuts in various...

The complexity of finding uniform sparsest cuts in various graph classes

Paul Bonsma, Hajo Broersma, Viresh Patel, Artem Pyatkin
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
14
Year:
2012
Language:
english
Pages:
14
DOI:
10.1016/j.jda.2011.12.008
File:
PDF, 293 KB
english, 2012
Conversion to is in progress
Conversion to is failed