An efficient sampling algorithm for difficult tree pairs
It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computing the rotation distance between an arbitrary pair of trees, (S, T), can be efficiently reduced to the problem of computi...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
University of Szeged, Institute of Informatics
Szeged
2022
|
| Sorozat: | Acta cybernetica
25 No. 3 |
| Kulcsszavak: | Algoritmus |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.285522 |
| Online Access: | http://acta.bibl.u-szeged.hu/75627 |
| Tartalmi kivonat: | It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computing the rotation distance between an arbitrary pair of trees, (S, T), can be efficiently reduced to the problem of computing the rotation distance between a difficult pair of trees (S', T'), where there is no known first step which is guaranteed to be the beginning of a minimal length path. Of interest, therefore, is how to sample such difficult pairs of trees of a fixed size. We show that it is possible to do so efficiently, and present such an algorithm that runs in time O(n4). |
|---|---|
| Terjedelem/Fizikai jellemzők: | 629-646 |
| ISSN: | 0324-721X |