A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs (Q507133): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jsc.2016.02.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JSC.2016.02.006 / rank | |||
Normal rank | |||
Revision as of 03:04, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs |
scientific article |
Statements
A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs (English)
0 references
3 February 2017
0 references
minimally rigid graphs
0 references
Laman graphs
0 references
Henneberg sequences
0 references
geometric constraint solving
0 references
geometric constraint graphs
0 references
tree-decomposition
0 references
