A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs (Q507133): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W40 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6680369 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimally rigid graphs | |||
Property / zbMATH Keywords: minimally rigid graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Laman graphs | |||
Property / zbMATH Keywords: Laman graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Henneberg sequences | |||
Property / zbMATH Keywords: Henneberg sequences / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
geometric constraint solving | |||
Property / zbMATH Keywords: geometric constraint solving / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
geometric constraint graphs | |||
Property / zbMATH Keywords: geometric constraint graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tree-decomposition | |||
Property / zbMATH Keywords: tree-decomposition / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2303885384 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4061956 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of embeddings of minimally rigid graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4274573 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4279195 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planar minimally rigid graphs and pseudo-triangulations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition plans for geometric constraint problems. II: New algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition plans for geometric constraint systems. I: Performance measures for CAD / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023900 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The non-solvability by radicals of generic 3-connected planar Laman graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rigidity, global rigidity, and graph decomposition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3694165 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4717849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3837775 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 08:43, 13 July 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