On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426)
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 7629136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees |
scientific article; zbMATH DE number 7629136 |
Statements
On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (English)
0 references
8 December 2022
0 references
leaf-distance granular regular \(\alpha\)-subtree (LDR \(\alpha\)-subtree)
0 references
weight
0 references
enumeration
0 references
generating function
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.9108722805976868
0 references
0.8309648036956787
0 references
0.77394038438797
0 references
0.771706759929657
0 references
0.731188952922821
0 references
