Pages that link to "Item:Q1978125"
From MaRDI portal
The following pages link to Graph rigidity via Euclidean distance matrices (Q1978125):
Displaying 13 items.
- Universal rigidity of bar frameworks via the geometry of spectrahedra (Q522288) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
- On bar frameworks, stress matrices and semidefinite programming (Q717126) (← links)
- Theory of semidefinite programming for sensor network localization (Q868476) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- On stress matrices of \((d + 1)\)-lateration frameworks in general position (Q1942275) (← links)
- On dimensional rigidity of bar-and-joint frameworks (Q2370423) (← links)
- On the dual rigidity matrix (Q2469523) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- On Flattenability of Graphs (Q3452282) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- On rigidity and realizability of weighted graphs (Q5932187) (← links)
