Efficient enumeration of ordered trees with \(k\) leaves (Q441889)
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: Efficient enumeration of ordered trees with k leaves |
scientific article; zbMATH DE number 6064163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient enumeration of ordered trees with \(k\) leaves |
scientific article; zbMATH DE number 6064163 |
Statements
Efficient enumeration of ordered trees with \(k\) leaves (English)
0 references
8 August 2012
0 references
graph algorithm
0 references
ordered tree
0 references
enumeration
0 references
family tree
0 references
0 references
0 references
0.991461217403412
0 references
0.8363063931465149
0 references
0.8282319903373718
0 references
0.8041533827781677
0 references
