Mostrar el registro sencillo del ítem
On the atomic decomposition length of graphs and tensegrities
dc.contributor.author | Fernández-Rodríguez, Jose David | |
dc.contributor.author | Orden Martín, David | |
dc.date.accessioned | 2013-12-03T12:57:11Z | |
dc.date.available | 2013-12-03T12:57:11Z | |
dc.date.issued | 2013-12-03 | |
dc.identifier.uri | http://hdl.handle.net/10630/6720 | |
dc.description.abstract | 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. | es_ES |
dc.description.sponsorship | Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. The present work was developed during a stay of Jose David Fernández Rodríguez at the Universidad de Alcalá, partially supported by the Departamento de Matemáticas de la Universidad de Alcalá. Jose David Fernández Rodríguez is partially supported by the Ministerio de Educación del Gobierno de España through a FPU grant (AP2007-03704). David Orden Martín is partially supported by grants MTM2008- 04699-C03-02/MTM and MTM2011-22792. | es_ES |
dc.language.iso | eng | es_ES |
dc.subject | Matemáticas computacionales | es_ES |
dc.subject.other | Tensegrity | es_ES |
dc.subject.other | Tensegrity atom | es_ES |
dc.subject.other | Atomic decomposition | es_ES |
dc.title | On the atomic decomposition length of graphs and tensegrities | es_ES |
dc.type | journal article | es_ES |
dc.centro | E.T.S.I. Informática | es_ES |
dc.relation.eventtitle | Séptimos Encuentros Andaluces de Matemática Discreta (7EAMD) | es_ES |
dc.relation.eventplace | Carmona, Sevilla, Spain | es_ES |
dc.relation.eventdate | 2011 Noviembre | es_ES |
dc.type.hasVersion | SMUR | es_ES |
dc.departamento | Lenguajes y Ciencias de la Computación | |
dc.rights.accessRights | open access |