• Jul 03, 2017 News!Good News! Since 2017, IJMLC has been indexed by Scopus!
  • Jul 06, 2017 News!Vol.7, No.2 has been published with online version.   [Click]
  • Jul 01, 2017 News!Vol.7, No.1 has been published with online version.   [Click]
Search
General Information
Editor-in-chief
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
IJMLC 2012 Vol.2(6): 767-770 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2012.V2.233

A Ranking Algorithm of Non-Regular Trees in Gray-Code Order

Ro–Yu Wu, Jou–Ming Chang, and An–Hang Chen

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.

Index Terms—Loopless algorithms, ranking algorithms, lexico-graphic order, gray-code order; non-regular trees.

Ro-Yu Wu is with the Department of Industrial Management, Lunghwa University of Science and Technology, Taoyuan, Taiwan. (e-mail:eric@mail.lhu.edu.tw)
Jou-Ming Chang and An-Hang Chen are with the Institute of Information and Decision Sciences, National Taipei College of Business, Taipei, Taiwan. (e-mail: spade@mail.ntcb.edu.tw; hang@mail.ntcb.edu.tw)

[PDF]

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 and Computing vol. 2, no. 6, pp. 767-770, 2012.

Copyright © 2008-2015. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net