Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Convex relaxation for the planted clique, biclique, and clustering problemsBrendan P. W. Ames. PhD thesis, University of Waterloo, Ontario, Canada, 2011. [doi] Convex optimization for the planted k-disjoint-clique problemBrendan P. W. Ames, Stephen A. Vavasis. mp, 143(1-2):299-337, 2014. [doi]
The following publications are possibly variants of this publication: