An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes (Q787893)
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: An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes |
scientific article; zbMATH DE number 3841658
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes |
scientific article; zbMATH DE number 3841658 |
Statements
An algorithm to equiprobably generate all directed trees with k labeled terminal nodes and unlabeled interior nodes (English)
0 references
1984
0 references
labeled terminal nodes
0 references
unlabeled interior nodes
0 references
