Spectral methods in cutting graphs
Dragan Stevanovic – University of Nis, Serbie
We give a short survey on the use of spectral methods in two opposite problems in combinatorial optimization: the min-cut (or clustering) and the max-cut.
We give a short survey on the use of spectral methods in two opposite problems in combinatorial optimization: the min-cut (or clustering) and the max-cut.