A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs (Q507133)

From MaRDI portal
Revision as of 09:43, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers