Abstract
The relaxation of random walks and the autocorrelation function on the landscape of the graph-bipartitioning problem are calculated.

This publication has 7 references indexed in Scilit: