A semidefinite programming approach to tensegrity theory and realizability of graphs

DOI10.1145/1109557.1109641zbMath1192.90137OpenAlexW4255300683MaRDI QIDQ3581591

Yinyu Ye, Anthony Man-Cho So

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109641

Mathematics Subject Classification ID

Semidefinite programming (90C22) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

Characterizing graphs with convex and connected Cayley configuration spaces ⋮ On stress matrices of \((d + 1)\)-lateration frameworks in general position ⋮ A new graph parameter related to bounded rank positive semidefinite matrix completions ⋮ On bar frameworks, stress matrices and semidefinite programming ⋮ Euclidean Distance Matrices and Applications ⋮ Selected Open Problems in Discrete Geometry and Optimization ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network ⋮ Iterative universal rigidity

Uses Software

• COL

This page was built for publication: A semidefinite programming approach to tensegrity theory and realizability of graphs