A general bijective algorithm for trees. (Q3487361)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4160753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general bijective algorithm for trees. |
scientific article; zbMATH DE number 4160753 |
Statements
A general bijective algorithm for trees. (English)
0 references
1990
0 references
Trees
0 references
Schröder trees
0 references
ordered partitions
0 references
Labeled rooted trees
0 references
labeled planed trees
0 references
Lagrange inversion formula
0 references
0.8291849493980408
0 references
0.7766010165214539
0 references
0.7749938368797302
0 references
0.7697352170944214
0 references
0.7697350978851318
0 references
