Edge and node searching problems on trees

Sheng Lung Peng, Chin Wen Ho, Tsan Sheng Hsu, Ming Tat Ko, Chuan Yi Tang

研究成果: 書貢獻/報告類型會議論文篇章同行評審

2 引文 斯高帕斯(Scopus)

摘要

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.

原文???core.languages.en_GB???
主出版物標題Computing and Combinatorics - 3rd Annual International Conference COCOON 1997, Proceedings
編輯Tao Jiang, D.T. Lee
發行者Springer Verlag
頁面284-293
頁數10
ISBN(列印)354063357X, 9783540633570
DOIs
出版狀態已出版 - 1997
事件3rd Annual International Computing and Combinatorics Conference, COCOON 1997 - Shanghai, China
持續時間: 20 8月 199722 8月 1997

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1276
ISSN(列印)0302-9743
ISSN(電子)1611-3349

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???3rd Annual International Computing and Combinatorics Conference, COCOON 1997
國家/地區China
城市Shanghai
期間20/08/9722/08/97

指紋

深入研究「Edge and node searching problems on trees」主題。共同形成了獨特的指紋。

引用此