doi: 10.7763/IJMLC.2012.V2.233
A Ranking Algorithm of Non-Regular Trees in Gray-Code Order
Ro–Yu Wu1
,
Jou–Ming Chang2 ,
An–Hang Chen2
- 1Department of Industrial Management, Lunghwa University of Science and Technology, Taoyuan, Taiwan.
- 2Institute of Information and Decision Sciences, National Taipei College of Business, Taipei, Taiwan.
Abstract
A non-regular tree T with a prescribed branching sequence is an ordered tree whose internal nodes are numbered from 1 to n in preorder such that every node in T has a prescribed number of children. Recently, Wu et al. (2010) introduced a concise representation called RD-sequences to represent all non-regular trees and proposed a loopless algorithm for generating all non-regular trees in a Gray-code order. In this paper, based on such a Gray-code order, we show that a ranking algorithm can be done in quadratic time provided a preprocessing in advance.
Keywords
- Loopless algorithms
- ranking algorithms
- lexico-graphic order
- gray-code order; non-regular trees
How to Cite
Ro–Yu Wu, Jou–Ming Chang, and An–Hang Chen, "A Ranking Algorithm of Non-Regular Trees in Gray-Code Order," International Journal of Machine Learning, vol. 2, no. 6, pp. 767-770, 2012. https://doi.org/10.7763/IJMLC.2012.V2.233
Copyright & License
Copyright © 2012 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).