Euclidean distance matrices and their applications in rigidity theory
From MaRDI portal
(Redirected from Publication:4555302)
Recommendations
- Universal rigidity of bar frameworks in general position: a Euclidean distance matrix approach
- Euclidean distance matrices and applications
- Euclidean distance matrices: new characterization and boundary properties
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
Cited in
(28)- Graph rigidity via Euclidean distance matrices
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
- Noisy Euclidean distance matrix completion with a single missing node
- On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices
- Simplices and regular polygonal tori in Euclidean Ramsey theory
- Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression
- An inverse formula for the distance matrix of a wheel graph with an even number of vertices
- On representations of graphs as two-distance sets
- On unit spherical Euclidean distance matrices which differ in one entry
- Quadratic embedding constants of graph joins
- Universal rigidity of bar frameworks in general position: a Euclidean distance matrix approach
- Euclidean distance matrices: new characterization and boundary properties
- Euclidean distance geometry. An introduction
- A facial reduction approach for the single source localization problem
- Complete multipartite graphs of non-QE class
- Geometric Characterization of Maximum Diversification Return Portfolio via Rao’s Quadratic Entropy
- Primary non-QE graphs on six vertices
- On the Colin de Verdière graph number and penny graphs
- Regularity lost: the fundamental limitations and constraint qualifications in the problems of elastoplasticity
- On quadratic embeddability of bipartite graphs and theta graphs
- A classification of graphs through quadratic embedding constants and clique graph insights
- On the local and global minimizers of the smooth stress function in Euclidean distance matrix problems
- Balance with memory in signed networks via Mittag-Leffler matrix functions
- Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming
- Stress solution of static linear elasticity with mixed boundary conditions via adjoint linear operators
- Quadratic embedding constants of corona graphs
- Elastoplasticity with softening as a state-dependent sweeping process: non-uniqueness of solutions and emergence of shear bands in lattices of springs
- Cayley-Menger curvature: a geometric approach to discrete curvature on graphs via local simplex embedding
This page was built for publication: Euclidean distance matrices and their applications in rigidity theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4555302)
