3 papers
math.OC2019
A Note on Convex Relaxations for the Inverse Eigenvalue Problem
Utkan Candogan, Yong Sheng Soh, Venkat Chandrasekaran
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications,…
cs.DS2019
Convex Graph Invariant Relaxations For Graph Edit Distance
Utkan Onur Candogan, Venkat Chandrasekaran
The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one gra…
math.OC2016
Finding Planted Subgraphs with Few Eigenvalues using the Schur-Horn Relaxation
Utkan Onur Candogan, Venkat Chandrasekaran
Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This pr…