2026-05-27T04:50:04Zhttps://riuma.uma.es/rest/oai/requestoai:riuma.uma.es:10630/67202026-02-03T11:32:37Zcom_10630_2254col_10630_37953
On the atomic decomposition length of graphs and tensegrities
Fernández-Rodríguez, Jose David
Orden Martín, David
Matemáticas computacionales
In this study, a complexity measure for graphs and tensegrities is proposed, based on the concept of
atomic decomposition.We state several results on the relationship between atomic decompositions
and spaces of self-stresses for generically rigid graphs, and study the computational complexity of
finding atomic decompositions of minimal length.
2013-12-03T12:57:11Z
2013-12-03T12:57:11Z
2013-12-03
journal article
http://hdl.handle.net/10630/6720
eng
Séptimos Encuentros Andaluces de Matemática Discreta (7EAMD)
Carmona, Sevilla, Spain
2011 Noviembre
open access