DocumentCode :
3322990
Title :
An Optimal Algorithm for Neville Codes of a Tree Network
Author :
Wu, Yingjie ; Chen, Kan ; Wang, Xiaodong
Author_Institution :
Comput. Sci. Dept., Fuzhou Univ., Fuzhou, China
fYear :
2009
fDate :
14-16 Dec. 2009
Firstpage :
420
Lastpage :
423
Abstract :
This paper studies the algorithms for coding and decoding second Neville´s codes of a tree network. The algorithms for coding and decoding second Neville´s codes of a labeled tree in the literatures require O(n log n) time usually. As stated, no linear time algorithms for the second Neville´s codes. In this paper we consider the second Neville´s code problem in a different angle and a more direct manner. We start from a naive algorithm, then improved it gradually and finally we obtain a very practical linear time algorithm. The techniques used in this paper are interesting themselves.
Keywords :
computational complexity; decoding; decoding; linear time algorithm; second Neville codes; tree network; Biological cells; Computer science; Data compression; Decoding; Ethernet networks; Genetic algorithms; Labeling; Mobile computing; Tree data structures; Tree graphs; Labeled tree; Neville code; Optimal Algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mobile Ad-hoc and Sensor Networks, 2009. MSN '09. 5th International Conference on
Conference_Location :
Fujian
Print_ISBN :
978-1-4244-5468-6
Type :
conf
DOI :
10.1109/MSN.2009.22
Filename :
5401502
Link To Document :
بازگشت