The maximum subforest problem: approximation and exact algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Frequent free tree discovery in graph data
Proceedings of the 2004 ACM symposium on Applied computing
Comprehensive isomorphic subtree enumeration
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
On graph query optimization in large networks
Proceedings of the VLDB Endowment
An in-depth comparison of subgraph isomorphism algorithms in graph databases
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O(~k/sup 1.8//log k\ n) time algorithm for this problem, where k and n are the number of vertices in H and G respectively. This improves over the O(k/sup 1.5/n) algorithms of Chung (1987) and Matula (1978). We also give a randomized (Las Vegas) O(min(k/sup 1.45/n, kn/sup 1.43/))-time algorithm for the decision problem.