Mostrar el registro sencillo del ítem

dc.contributor.authorFernández Rodríguez, Jose David
dc.contributor.authorOrden Martín, David
dc.date.accessioned2013-12-03T12:57:11Z
dc.date.available2013-12-03T12:57:11Z
dc.date.issued2013-12-03
dc.identifier.urihttp://hdl.handle.net/10630/6720
dc.description.abstractIn 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.sponsorshipUniversidad 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.isoenges_ES
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectMatemáticas computacionaleses_ES
dc.subject.otherTensegrityes_ES
dc.subject.otherTensegrity atomes_ES
dc.subject.otherAtomic decompositiones_ES
dc.titleOn the atomic decomposition length of graphs and tensegritieses_ES
dc.typeinfo:eu-repo/semantics/preprintes_ES
dc.centroE.T.S.I. Informáticaes_ES
dc.relation.eventtitleSéptimos Encuentros Andaluces de Matemática Discreta (7EAMD)es_ES
dc.relation.eventplaceCarmona, Sevilla, Spaines_ES
dc.relation.eventdate2011 Noviembrees_ES


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem