Login / Signup
Finding Planted Subgraphs with Few Eigenvalues using the Schur-Horn Relaxation.
Utkan Onur Candogan
Venkat Chandrasekaran
Published in:
CoRR (2016)
Keyphrases
</>
data structure
np hard
maximum clique
face recognition
kernel methods
graph mining
probabilistic relaxation