Min-cut clustering, based on minimizing one of two heuristic cost functions proposed by Shi and Malik nearly a decade ago, has spawned tremendous research, both analytic and algorithmic, in the graph ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results