Linear time algorithms for finding sparsest cuts in various graph classes.

Published in: Electron. Notes Discret. Math. (2007)

Keyphrases

graph theory
worst case
data structure
maximum clique
equivalence classes
computational cost
graph structures
partitioning algorithm
upper bound
significant improvement
weighted graph
graph theoretic
minimum spanning tree
computational complexity
maximum flow
graph based algorithm
learning algorithm