An SDP-Based Divide-and-Conquer Algorithm for Large-scale Noisy Anchor-free Graph Realization
We propose the DISCO algorithm for graph realization in $\mathbb{R}^d$, given sparse and noisy short-range intervertex distances as inputs. Our divide-and-conquer algorithm works as follows. When a group has a sufficiently small number of vertices, the basis step is to form a graph realization by so...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Society for Industrial and Applied Mathematics
2010
|
| Online Access: | http://hdl.handle.net/1721.1/58306 |