@inproceedings{17e5ef32ad2546a6b57032345e5243a7,
title = "Edge and node searching problems on trees",
abstract = "In this paper, we show that there is a natural correspondence between a tree's edge-search strategy and its node-search strategy. By doing so, we simplify the previous linear time algorithm for determining the edge-search number of a tree, and improve the running time of a previous algorithm for constructing an edge-search strategy (or plan) for a tree containing n vertices from O(n log n) to O(n) time.",
author = "Peng, {Sheng Lung} and Ho, {Chin Wen} and Hsu, {Tsan Sheng} and Ko, {Ming Tat} and Tang, {Chuan Yi}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 3rd Annual International Computing and Combinatorics Conference, COCOON 1997 ; Conference date: 20-08-1997 Through 22-08-1997",
year = "1997",
doi = "10.1007/bfb0045095",
language = "???core.languages.en_GB???",
isbn = "354063357X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "284--293",
editor = "Tao Jiang and D.T. Lee",
booktitle = "Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings",
}