An efficient sampling algorithm for difficult tree pairs

Cleary Sean and Maio Roland: An efficient sampling algorithm for difficult tree pairs. In: Acta cybernetica, (25) 3. pp. 629-646. (2022)

[thumbnail of cybernetica_025_numb_003_629-646.pdf] Cikk, tanulmány, mű

Download (305kB)


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).

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2022
Volume: 25
Number: 3
ISSN: 0324-721X
Page Range: pp. 629-646
Language: English
Publisher: University of Szeged, Institute of Informatics
Place of Publication: Szeged
Event Title: Conference of PhD Students in Computer Science (12.) (2020) (Szeged)
Related URLs:
DOI: 10.14232/actacyb.285522
Uncontrolled Keywords: Algoritmus
Additional Information: Bibliogr.: p. 645-646. ; ill. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2022. May. 13. 09:47
Last Modified: 2022. May. 13. 09:47

Actions (login required)

View Item View Item