Rotational tree structures on binary trees and triangulations

Pallo Jean Marcel: Rotational tree structures on binary trees and triangulations. In: Acta cybernetica, (17) 4. pp. 799-810. (2006)

[thumbnail of Pallo_2006_ActaCybernetica.pdf]
Cikk, tanulmány, mű

Download (151kB) | Preview


A rotation in a binary tree is a simple and local restructuring technique commonly used in computer science. We propose in this paper three restrictions on the general rotation operation. We study the case when only leftmost rotations are permitted, which corresponds to a natural flipping on polygon triangulations. The resulting combinatorial structure is a tree structure with the root as the greatest element. We exhibit an efficient algorithm for computing the join of two trees and the minimum number of leftmost rotations necessary to transform one tree into the other.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2006
Volume: 17
Number: 4
ISSN: 0324-721X
Page Range: pp. 799-810
Language: English
Place of Publication: Szeged
Event Title: International Conference on Automata and Formal Languages (11.) (2005) (Dobogókő)
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 809-810. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 16. 10:02

Actions (login required)

View Item View Item