loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Information Technology: Coding and Computing
Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order
Las Vegas, Nevada
April 08-April 10
ISBN: 0-7695-1506-1
ASCII Text
x 
 
Limin Xiang, Kazuo Ushijima, Yuichi Asahiro, "Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order," Information Technology: Coding and Computing, International Conference on, pp. 0396, International Conference on Information Technology: Coding and Computing, 2002.
 
 
BibTex
x
 
@article{ 10.1109/ITCC.2002.1000422,
author = {Limin Xiang and Kazuo Ushijima and Yuichi Asahiro},
title = {Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order},
journal ={Information Technology: Coding and Computing, International Conference on},
volume = {0},
year = {2002},
isbn = {0-7695-1506-1},
pages = {0396},
doi = {http://doi.ieeecomputersociety.org/10.1109/ITCC.2002.1000422},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Information Technology: Coding and Computing, International Conference on
TI - Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order
SN - 0-7695-1506-1
SP
EP
A1 - Limin Xiang,
A1 - Kazuo Ushijima,
A1 - Yuichi Asahiro,
PY - 2002
KW - coding $k$-ary trees; loopless generation; lexicographic order
VL - 0
JA - Information Technology: Coding and Computing, International Conference on
ER -
 
Limin Xiang, Kyushu Sangyo University
Kazuo Ushijima, Kyushu Sangyo University
Yuichi Asahiro, Kyushu Sangyo University
In this paper, {\em e-word}s are used for coding $k$-ary trees with $n$ internal nodes. The properties of e-words are discussed in depth, such as the necessary and sufficient condition of e-words, and based on the properties, a loopless algorithm is obtained to generate e-words for $k$-ary trees in lexicographic order, which is more efficient in both space and time than the previous algorithm. In addition, e-words can also be easily generated in lexicographic order by a recursive algorithm, and in the order with the Strong Minimal Change Property (SMCP) by a loopless algorithm.
Index Terms:
coding $k$-ary trees; loopless generation; lexicographic order
Citation:
Limin Xiang, Kazuo Ushijima, Yuichi Asahiro, "Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order," itcc, pp.0396, International Conference on Information Technology: Coding and Computing, 2002
Usage of this product signifies your acceptance of the Terms of Use.