Compressive Sensing for cut improvement and local clustering

Ming-Jun Lai, Daniel Mckenzie

We show how one can phrase the cut improvement problem for graphs as a sparse recovery problem, whence one can use algorithms originally developed for use in compressive sensing (s…