Calculating maximal order types for finite rooted unstructured labeled trees (Q5013906)
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 7438598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Calculating maximal order types for finite rooted unstructured labeled trees |
scientific article; zbMATH DE number 7438598 |
Statements
Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees (English)
0 references
3 December 2021
0 references
binary two-labeled unstructured trees
0 references
tree embeddability relations
0 references
0.8190736770629883
0 references
0.7539604306221008
0 references
0.7531470060348511
0 references
0.748404860496521
0 references
0.7406924962997437
0 references
