A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs (Q507133): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W40
@@ Property / Mathematics Subject Classification ID: 68W40 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6680369
@@ 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

Revision as of 01:51, 1 July 2023