Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang. A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. In Wen-Lian Hsu, Ming-Yang Kao, editors, Computing and Combinatorics, 4th Annual International Conference, COCOON 98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings. Volume 1449 of Lecture Notes in Computer Science, pages 279-288, Springer, 1998. [doi]
@inproceedings{PengHHKT98,
title = {A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree},
author = {Sheng-Lung Peng and Chin-Wen Ho and Tsan-sheng Hsu and Ming-Tat Ko and Chuan Yi Tang},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1449/14490279.htm},
tags = {search},
researchr = {https://researchr.org/publication/PengHHKT98},
cites = {0},
citedby = {0},
pages = {279-288},
booktitle = {Computing and Combinatorics, 4th Annual International Conference, COCOON 98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings},
editor = {Wen-Lian Hsu and Ming-Yang Kao},
volume = {1449},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-64824-0},
}