dc.contributor.author Hidalgo, Marta R. dc.contributor.author Joan Arinyo, Robert dc.contributor.other Universitat Politècnica de Catalunya. Departament de Ciències de la Computació dc.date.accessioned 2017-03-08T18:57:16Z dc.date.available 2019-04-30T00:30:46Z dc.date.issued 2017-03-01 dc.identifier.citation Hidalgo, M., Joan-Arinyo, R. A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs. "Journal of symbolic computation", 1 Març 2017, vol. 79, Part 2, p. 232-248. dc.identifier.issn 0747-7171 dc.identifier.uri http://hdl.handle.net/2117/102162 dc.description.abstract In this work we describe an algorithm to generate tree-decomposable minimally rigid graphs on a given set of vertices V . The main idea is based on the well-known fact that all minimally rigid graphs, also known as Laman graphs, can be generated via Henneberg sequences. Given that not each minimally rigid graph is tree-decomposable, we identify a set of conditions on the way Henneberg steps are applied so that the resulting graph is tree-decomposable. We show that the worst case running time of the algorithm is O(|V|3). dc.format.extent 17 p. dc.language.iso eng dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/es/ dc.subject Àrees temàtiques de la UPC::Informàtica dc.subject.lcsh Graph algorithms dc.subject.other Minimally rigid graphs dc.subject.other Laman graphs dc.subject.other Henneberg sequences dc.subject.other Geometric constraint solving dc.subject.other Geometric constraint graphs dc.subject.other Tree-decomposition dc.title A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs dc.type Article dc.subject.lemac Algorismes de grafs dc.contributor.group Universitat Politècnica de Catalunya. GIE - Grup d'Informàtica a l'Enginyeria dc.identifier.doi 10.1016/j.jsc.2016.02.006 dc.relation.publisherversion http://www.sciencedirect.com/science/article/pii/S0747717116000158 dc.rights.access Open Access drac.iddocument 19343153 dc.description.version Postprint (author's final draft) upcommons.citation.author Hidalgo, M., Joan-Arinyo, R. upcommons.citation.published true upcommons.citation.publicationName Journal of symbolic computation upcommons.citation.volume 79, Part 2 upcommons.citation.startingPage 232 upcommons.citation.endingPage 248
﻿

### This item appears in the following Collection(s)

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain