Convex Relaxations for Graph and Inverse Eigenvalue Problems
<p>This thesis is concerned with presenting convex optimization based tractable solutions for three fundamental problems:</p> <p>1. <i>Planted subgraph problem</i>: Given two graphs, identifying the subset of vertices of the larger graph corresponding to the smaller...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
2020
|
| Online Access: | https://thesis.library.caltech.edu/13622/12/Candogan_Utkan_2020.pdf Candogan, Utkan Onur (2020) Convex Relaxations for Graph and Inverse Eigenvalue Problems. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/ZV0D-SW58. https://resolver.caltech.edu/CaltechTHESIS:01152020-210801253 <https://resolver.caltech.edu/CaltechTHESIS:01152020-210801253> |
Internet
https://thesis.library.caltech.edu/13622/12/Candogan_Utkan_2020.pdfCandogan, Utkan Onur (2020) Convex Relaxations for Graph and Inverse Eigenvalue Problems. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/ZV0D-SW58. https://resolver.caltech.edu/CaltechTHESIS:01152020-210801253 <https://resolver.caltech.edu/CaltechTHESIS:01152020-210801253>