Pages that link to "Item:Q1894505"
From MaRDI portal
The following pages link to Connections between the real positive semidefinite and distance matrix completion problems (Q1894505):
Displaying 28 items.
- On cell matrices: a class of Euclidean distance matrices (Q275228) (← links)
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Hyperspherical embedding of graphs and networks in communicability spaces (Q403566) (← links)
- Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
- Majorization for the eigenvalues of Euclidean distance matrices (Q665966) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix (Q726657) (← links)
- The cell matrix closest to a given Euclidean distance matrix (Q745190) (← links)
- On Euclidean distance matrices (Q884414) (← links)
- Multispherical Euclidean distance matrices (Q977468) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- On Cartesian product of Euclidean distance matrices (Q1629838) (← links)
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems (Q1810881) (← links)
- Better initial configurations for metric multidimensional scaling (Q1874126) (← links)
- Circum-Euclidean distance matrices and faces (Q1906789) (← links)
- Graph rigidity via Euclidean distance matrices (Q1978125) (← links)
- Phase retrieval of complex and vector-valued functions (Q2155281) (← links)
- Generically globally rigid graphs have generic universally rigid frameworks (Q2182252) (← links)
- Moore-Penrose inverse of a Euclidean distance matrix (Q2259283) (← links)
- Linear spectral sets and their extremal varieties (Q2361400) (← links)
- Characterization of multispherical and block structures of Euclidean distance matrices (Q2435528) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
- Faces of the cone of Euclidean distance matrices: characterizations, structure and induced geometry (Q2568355) (← links)
- Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems (Q2706294) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree (Q4606658) (← links)
- The Euclidean distance completion problem: cycle completability (Q4853938) (← links)
- Euclidean distance matrix completion problems (Q5200557) (← links)
