On Chen and Chen's new tree inclusion algorithm

Authors:
Hai-Lung Cheng;Biing-Feng Wang
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China
Venue:
Information Processing Letters
Year:
2007

Citing 6
Cited 0

On query languages for the P-string data model

Information modelling and knowledge bases
On the complexity of finding iso- and other morphisms for partial k-trees

Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Ordered and Unordered Tree Inclusion

SIAM Journal on Computing
More efficient algorithm for ordered tree inclusion

Journal of Algorithms
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
A new tree inclusion algorithm

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

Very recently, Chen and Chen [Y. Chen, Y. Chen, A new tree inclusion algorithm, Information Processing Letters 98 (2006) 253-262] gave a new algorithm for the tree inclusion problem, which requires O(|T|xmin{depth(P),|leaves(P)|}) time and no extra space. In this Note, we show that there are flaws in their time-complexity analysis by presenting two counterexamples. We also give an example to show that the worst-case time complexity of their algorithm is non-polynomial. Consequently, the asymptotically most efficient algorithm for the tree inclusion problem is the former algorithm in [W. Chen, More efficient algorithm for ordered tree inclusion, Journal of Algorithms 26 (1998) 370-385].