Pages that link to "Item:Q1978125"
From MaRDI portal
The following pages link to Graph rigidity via Euclidean distance matrices (Q1978125):
Displayed 8 items.
- 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 dimensional rigidity of bar-and-joint frameworks (Q2370423) (← links)
- On the dual rigidity matrix (Q2469523) (← links)
- On rigidity and realizability of weighted graphs (Q5932187) (← links)