O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
Journal of Algorithms
On the subtree isomorphism problem for ordered trees
Information Processing Letters
An analysis of a good algorithm for the subtree problem, correlated
SIAM Journal on Computing
Some comments on the subtree isomorphism problem for ordered trees
Information Processing Letters
A note on the subtree isomorphism for ordered trees and related problems
Information Processing Letters
Information Processing Letters
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
Retrieval from hierarchical texts by partial patterns
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Information Processing Letters
Efficient labelling algorithms for the maximum noncrossing matching problem
Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
More efficient algorithm for ordered tree inclusion
Journal of Algorithms
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Journal of Algorithms
Querying and ranking XML documents
Journal of the American Society for Information Science and Technology - XML
Acta Informatica
Data Structures: Theory and Practice
Data Structures: Theory and Practice
Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
Efficient Parallel Algorithms for Tree Editing Problems
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
A New Algorithm for the Ordered Tree Inclusion Problem
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Theoretical Computer Science
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
Algorithms for finding a most similar subforest
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
The tree matching problem is considered of given labeled trees P and T, determining if the pattern tree P can be obtained from the text tree T by deleting degree-one and degree-two nodes and, in the case of unordered trees, by also permuting siblings. The constrained tree inclusion problem is more sensitive to the structure of the pattern tree than the general tree inclusion problem. Further, it can be solved in polynomial time for both unordered and ordered trees. Algorithms based on the subtree homeomorphism algorithm of (Chung, 1987) are presented that solve the constrained tree inclusion problem in O(m1.5n) time on unordered trees with m and n nodes, and in O(mn) time on ordered trees, using O(mn) additional space. These algorithms can be improved using results of (Shamir and Tsur, 1999) to run in O((m1.5/log m)n) and O((m/ logm)n) time, respectively.