Generating strictly binary trees at random based on convex polygon triangulations (Q2804906)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generating strictly binary trees at random based on convex polygon triangulations |
scientific article; zbMATH DE number 6577960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating strictly binary trees at random based on convex polygon triangulations |
scientific article; zbMATH DE number 6577960 |
Statements
Generating strictly binary trees at random based on convex polygon triangulations (English)
0 references
6 May 2016
0 references
convex polygon triangulation
0 references
edge
0 references
diagonal
0 references
strictly binary tree
0 references
binary tree
0 references
node
0 references
recursive algorithm
0 references
0.8352198004722595
0 references
0.7887284755706787
0 references
0.7879235148429871
0 references
0.7812677025794983
0 references
0.780902624130249
0 references
