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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.