Graph rigidity via Euclidean distance matrices

DOI10.1016/S0024-3795(00)00066-5zbMath0965.05069WikidataQ127629891 ScholiaQ127629891MaRDI QIDQ1978125

Abdo Y. Alfakih

Publication date: 25 May 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

normal conerigiditysemi-definite programmingEuclidean distance matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Applications of graph theory to circuits and networks (94C15)

Related Items (13)

On dimensional rigidity of bar-and-joint frameworks ⋮ On Flattenability of Graphs ⋮ Theory of semidefinite programming for sensor network localization ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier ⋮ On stress matrices of \((d + 1)\)-lateration frameworks in general position ⋮ On the uniqueness of Euclidean distance matrix completions. ⋮ (Robust) edge-based semidefinite programming relaxation of sensor network localization ⋮ On the dual rigidity matrix ⋮ Universal rigidity of bar frameworks via the geometry of spectrahedra ⋮ On rigidity and realizability of weighted graphs ⋮ On bar frameworks, stress matrices and semidefinite programming ⋮ Euclidean Distance Matrices and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of Euclidean and non-Euclidean distance matrices
• On certain linear mappings between inner-product and squared-distance matrices
• Some applications of optimization in matrix theory
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Cuts, matrix completions and graph rigidity
• Connections between the real positive semidefinite and distance matrix completion problems
• Some geometric results in semidefinite programming
• On graphs and rigidity of plane skeletal structures
• The cone of distance matrices
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Rigid and Flexible Frameworks
• On Generic Rigidity in the Plane
• Conditions for Unique Graph Realizations
• The Rigidity of Graphs
• Cone-LP's and semidefinite programs: Geometry and a simplex-type method
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming
• Singular Points of Complex Hypersurfaces. (AM-61)

This page was built for publication: Graph rigidity via Euclidean distance matrices