A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs
Visualitza/Obre
Cita com:
hdl:2117/102162
Tipus de documentArticle
Data publicació2017-03-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
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).
Citació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.
ISSN0747-7171
Versió de l'editorhttp://www.sciencedirect.com/science/article/pii/S0747717116000158
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
henneberg-RJA.pdf | 319,8Kb | Visualitza/Obre |