Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 82, 2005 - Issue 9
Submit an article Journal homepage
74
Views
9
CrossRef citations to date
0
Altmetric
Original Articles

An efficient algorithm for estimating rotation distance between two binary trees

Yen-Ju Chen Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, Republic of China
,
Jou-Ming Chang Department of Information Management, National Taipei College of Business, Taipei, Taiwan, Republic of China
&
Yue-li Wang Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, Republic of ChinaCorrespondence[email protected]
Pages 1095-1106 | Received 06 Oct 2004, Published online: 19 Aug 2006

Citations (9)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Joan M. Lucas. (2008) Effective splaying with restricted rotations. International Journal of Computer Mathematics 85:5, pages 717-726.
Read now

Articles from other publishers (8)

Haohong Li & Ge Xia. (2023) An $$\mathcal {O}(3.82^{k})$$ Time $$\textsf {FPT}$$ Algorithm for Convex Flip Distance. Discrete & Computational Geometry.
Crossref
Fabrizio Luccio, Bernard Mans, Luke Mathieson & Linda Pagli. (2016) Complete Balancing via Rotation. The Computer Journal 59:8, pages 1252-1263.
Crossref
Fabrizio Luccio, Antonio Mesa Enriquez & Linda Pagli. (2010) Lower bounds on the rotation distance of binary trees. Information Processing Letters 110:21, pages 934-938.
Crossref
Joan M. Lucas. (2010) An improved kernel size for rotation distance in binary trees. Information Processing Letters 110:12-13, pages 481-484.
Crossref
Deqiang Wang, Xian Wang, Shaoxi Li & Shaofang Zhang. (2008) Diagonal-Flip Distance Algorithms of Three Type Triangulations. Diagonal-Flip Distance Algorithms of Three Type Triangulations.
Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin & David R. Wood. (2006) Simultaneous diagonal flips in plane triangulations. Journal of Graph Theory 54:4, pages 307-330.
Crossref
Jean-Luc Baril & Jean-Marcel Pallo. (2006) Efficient lower and upper bounds of the diagonal-flip distance between triangulations. Information Processing Letters 100:4, pages 131-136.
Crossref
Ro-Yu Wu, Jou-Ming Chang & Yue-Li Wang. (2006) A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. Theoretical Computer Science 355:3, pages 303-314.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.