Rotational tree structures on binary trees and triangulations
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...
Elmentve itt :
Szerző: | |
---|---|
Testületi szerző: | |
Dokumentumtípus: | Cikk |
Megjelent: |
2006
|
Sorozat: | Acta cybernetica
17 No. 4 |
Kulcsszavak: | Számítástechnika, Kibernetika |
Tárgyszavak: | |
Online Access: | http://acta.bibl.u-szeged.hu/12796 |
LEADER | 01427nab a2200229 i 4500 | ||
---|---|---|---|
001 | acta12796 | ||
005 | 20220616100219.0 | ||
008 | 161015s2006 hu o 0|| eng d | ||
022 | |a 0324-721X | ||
040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
041 | |a eng | ||
100 | 1 | |a Pallo Jean Marcel | |
245 | 1 | 0 | |a Rotational tree structures on binary trees and triangulations |h [elektronikus dokumentum] / |c Pallo Jean Marcel |
260 | |c 2006 | ||
300 | |a 799-810 | ||
490 | 0 | |a Acta cybernetica |v 17 No. 4 | |
520 | 3 | |a 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. | |
650 | 4 | |a Természettudományok | |
650 | 4 | |a Számítás- és információtudomány | |
695 | |a Számítástechnika, Kibernetika | ||
710 | |a International Conference on Automata and Formal Languages (11.) (2005) (Dobogókő) | ||
856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12796/1/Pallo_2006_ActaCybernetica.pdf |z Dokumentum-elérés |