Graphs are a ubiquitous mathematical abstraction used in numerous problems in science and engineering. Of particular importance is the need to find the best structure-preserving matching of graphs.

Abstract: In this paper, we present a novel convex method for the graph-structured sparse recovery. While various structured sparsities can be represented as the graph-structured sparsity, graph- ...