Graph rigidity via Euclidean distance matrices

DOI10.1016/S0024-3795(00)00066-5MaRDI QIDQ1978125zbMATH OpenWikidataFDO

Authors Abdo Y. Alfakih

Publication date 25 May 2000

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

zbMATH Keywords

normal conerigidityEuclidean distance matricessemi-definite programming

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2145238
• On Euclidean distance matrices of graphs
• Algebraic Distance Graphs and Rigidity
• Euclidean distance matrices and their applications in rigidity theory
• Spectral conditions for graph rigidity in the Euclidean plane
• Rigidity and reconstruction for graphs
• Graph rigidity for unitarily invariant matrix norms
• scientific article; zbMATH DE number 782048
• Rigidity, Graphs and Hausdorff Dimension
• Rigidity, global rigidity, and graph decomposition

Cites work

• scientific article; zbMATH DE number 446693 (Why is no real title available?)
• scientific article; zbMATH DE number 67319 (Why is no real title available?)
• scientific article; zbMATH DE number 2188749 (Why is no real title available?)
• scientific article; zbMATH DE number 3293562 (Why is no real title available?)
• Conditions for Unique Graph Realizations
• Cone-LP's and semidefinite programs: geometry and a simplex-type method
• Connections between the real positive semidefinite and distance matrix completion problems
• Cuts, matrix completions and graph rigidity
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On Generic Rigidity in the Plane
• On certain linear mappings between inner-product and squared-distance matrices
• On graphs and rigidity of plane skeletal structures
• Properties of Euclidean and non-Euclidean 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
• Semidefinite Programming
• Singular Points of Complex Hypersurfaces. (AM-61)
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Some applications of optimization in matrix theory
• Some geometric results in semidefinite programming
• The Rigidity of Graphs
• The cone of distance matrices

Cited in

(17)

• Theory of semidefinite programming for sensor network localization
• On the dual rigidity matrix
• On rigidity and realizability of weighted graphs
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• On the uniqueness of Euclidean distance matrix completions.
• On affine rigidity
• On dimensional rigidity of bar-and-joint frameworks
• On stress matrices of \((d + 1)\)-lateration frameworks in general position
• Algebraic Distance Graphs and Rigidity
• Characterizing graphs with convex and connected Cayley configuration spaces
• Euclidean graph distance matrices of generalizations of the star graph
• (Robust) edge-based semidefinite programming relaxation of sensor network localization
• Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
• Euclidean distance matrices and applications
• On bar frameworks, stress matrices and semidefinite programming
• On Flattenability of Graphs
• Universal rigidity of bar frameworks via the geometry of spectrahedra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978125)