Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation

Brendan P. W. Ames. Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation. J. Optimization Theory and Applications, 167(2):653-675, 2015. [doi]

Abstract

Abstract is missing.