The complexity of finding uniform sparsest cuts in various graph classes

P.S. Bonsma, Haitze J. Broersma, Viresh Patel, A.V. Pyatkin

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
22 Downloads (Pure)

Fingerprint Dive into the research topics of 'The complexity of finding uniform sparsest cuts in various graph classes'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science