Inference on graphs via semidefinite programming
Inference problems on graphs arise naturally when trying to make sense of network data. Oftentimes, these problems are formulated as intractable optimization programs. This renders the need for fast heuristics to find adequate solutions and for the study of their performance. For a certain class of...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
National Academy of Sciences (U.S.)
2017
|
| Online Access: | http://hdl.handle.net/1721.1/109985 https://orcid.org/0000-0002-7331-7557 |