Graph rigidity via Euclidean distance matrices
- 1 May 2000
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 310 (1-3) , 149-165
- https://doi.org/10.1016/s0024-3795(00)00066-5
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Solving Euclidean Distance Matrix Completion Problems Via Semidefinite ProgrammingComputational Optimization and Applications, 1999
- Connections between the real positive semidefinite and distance matrix completion problemsLinear Algebra and its Applications, 1995
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- RigidityPublished by Elsevier ,1993
- Conditions for Unique Graph RealizationsSIAM Journal on Computing, 1992
- The cone of distance matricesLinear Algebra and its Applications, 1991
- On certain linear mappings between inner-product and squared-distance matricesLinear Algebra and its Applications, 1988
- Properties of Euclidean and non-Euclidean distance matricesLinear Algebra and its Applications, 1985
- The rigidity of graphsTransactions of the American Mathematical Society, 1978
- On graphs and rigidity of plane skeletal structuresJournal of Engineering Mathematics, 1970