Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
| Year of publication: |
1986
|
|---|---|
| Authors: | Křivánek, Mirko |
| Published in: |
Journal of Classification. - Springer. - Vol. 3.1986, 1, p. 55-60
|
| Publisher: |
Springer |
| Subject: | Nearest neighbor interchange metric | Binary tree (dendogram) | NP-completeness theory |
| Extent: | text/html |
|---|---|
| Type of publication: | Article |
| Source: |
Persistent link: https://ebvufind01.dmz1.zbw.eu/10005156043