Best match graphs with binary trees (Q2062000)
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 7450230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Best match graphs with binary trees |
scientific article; zbMATH DE number 7450230 |
Statements
Best match graphs with binary trees (English)
0 references
21 December 2021
0 references
best match graphs
0 references
binary trees
0 references
rooted triple consistency
0 references
polynomial-time algorithm
0 references
0 references
0 references
0.9084190726280212
0 references
0.7991991639137268
0 references
0.7981433868408203
0 references
0.7953961491584778
0 references
0.7897288203239441
0 references
