On rigidity and realizability of weighted graphs
From MaRDI portal
Publication:5932187
DOI10.1016/S0024-3795(00)00281-0zbMath0977.05086WikidataQ126351682 ScholiaQ126351682MaRDI QIDQ5932187
Publication date: 17 January 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
semidefinite programmingconvex setsrigiditycharacterizationweighted graphsEuclidean distance matricesrealizabilityrigid graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Structural characterization of families of graphs (05C75) Applications of graph theory to circuits and networks (94C15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
A remark on the faces of the cone of Euclidean distance matrices, On dimensional rigidity of bar-and-joint frameworks, Theory of semidefinite programming for sensor network localization, LRA: local rigid averaging of stretchable non-rigid shapes, On stress matrices of \((d + 1)\)-lateration frameworks in general position, On the uniqueness of Euclidean distance matrix completions., On Euclidean distances and sphere representations, On the dual rigidity matrix, On representations of graphs as two-distance sets, Two theorems on Euclidean distance matrices and Gale transform, Euclidean Distance Matrices and Applications
Cites Work
