Finding Eulerian cycle decompositions and the rotation distance between binary trees (Q3406744)
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: Finding Eulerian cycle decompositions and the rotation distance between binary trees |
scientific article; zbMATH DE number 5673653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Eulerian cycle decompositions and the rotation distance between binary trees |
scientific article; zbMATH DE number 5673653 |
Statements
19 February 2010
0 references
rooted binary trees
0 references
rotation distance
0 references
sorting by reversals
0 references
breakpoint graphs
0 references
0.8063793182373047
0 references
0.7536534667015076
0 references
0.7420976758003235
0 references
0.7383606433868408
0 references
