Pages that link to "Item:Q1077168"
From MaRDI portal
The following pages link to Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete (Q1077168):
Displaying 3 items.
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- On bounds for the rotation distance between binary coupling trees (Q2741329) (← links)
- APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES (Q5249276) (← links)