Can I read Edge and Node Searching Problems on Trees on EtoBox?

Edge and Node Searching Problems on Trees by Sheng-Lung Peng; Chin-Wen Ho; Tsan-sheng Hsu; Ming-Tat Ko; Chuan Yi Tang is a Computer Science article available to read on EtoBox.

What is Edge and Node Searching Problems on Trees about?

In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-search strategy. Using our transformation, we simplify a 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 optimal edge-search strategy of an n-vertex tree from O(nlogn) to O(n). We also improve the running time of a previous algorithm for constructing an optimal min-cut linear layout of an n-vertex tree with the maximum degree 3 from O(nlogn) to O(n).

Who reads Edge and Node Searching Problems on Trees?

Author

Sheng-Lung Peng; Chin-Wen Ho; Tsan-sheng Hsu; Ming-Tat Ko; Chuan Yi Tang

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)

Published

2000

Language

EN

Field

Computer Science (Physical Sciences)