A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree

Authors:
Sheng-Lung Peng;Chin-Wen Ho;Tsan-sheng Hsu;Ming-Tat Ko;Chuan Yi Tang
Affiliations:
-;-;-;-;-
Venue:
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Year:
1998

Citing 16
Cited 0

Searching and pebbling

Theoretical Computer Science
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
The complexity of searching a graph

Journal of the ACM (JACM)
Min cut is NP-complete for edge weighted trees

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Monotonicity in graph searching

Journal of Algorithms
Narrowness, pathwidth, and their application in natural language processing

Discrete Applied Mathematics
The vertex separation number of a graph equals its path-width

Information Processing Letters
Recontamination does not help to search a graph

Journal of the ACM (JACM)
The pathwidth and treewidth of cographs

SIAM Journal on Discrete Mathematics
On the pathwidth of chordal graphs

Discrete Applied Mathematics - ARIDAM IV and V
The vertex separation and search number of a graph

Information and Computation
Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
Graph Searching on Chordal Graphs

ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Edge and Node Searching Problems on Trees

COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators

ESA '93 Proceedings of the First Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ellis et al., proposed algorithms (in terms of vertexsep aration) to compute the node-search number of an n-vertextree T in O(n) time and to construct an optimal node-search strategy of T in O(n log n) time. An open problem is whether the latter can also be done in linear time. In this paper, we solve this open problem by exploring fundamental graph theoretical properties.