Login / Signup
The complexity of finding uniform sparsest cuts in various graph classes.
Paul S. Bonsma
Hajo Broersma
Viresh Patel
Artem V. Pyatkin
Published in:
J. Discrete Algorithms (2012)
Keyphrases
</>
tractable cases
maximum clique
complexity measures
graph structure
weighted graph
random walk
graph theoretic
computational complexity
bipartite graph
graph theory
graph matching
learning algorithm
directed graph
space complexity
equivalence classes
min cut
computational cost