Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete

✍ Scribed by Mirko Křivánek

• Book ID: 105393308
• Publisher: Springer
• Year: 1986
• Tongue: English
• Weight: 282 KB
• Volume: 3
• Category: Article
• ISSN: 0176-4268
• DOI: 10.1007/bf01896811