Is there an algorithm to find sparse cuts in a graph ?

I am looking to find the best cut which minimizes the sparsity of a graph.

	[[alternative HTML version deleted]]

