Faster subtree isomorphism (1999)
Cached
Download Links
- [www.cs.bgu.ac.il]
- [www.math.tau.ac.il]
- [cs.haifa.ac.il]
- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- [cs.haifa.ac.il]
- [www.cs.kuleuven.be]
- DBLP
Other Repositories/Bibliography
by
Ron Shamir
,
Dekel Tsur
| Venue: | Journal of Algorithms |
| Citations: | 28 - 2 self |
BibTeX
@ARTICLE{Shamir99fastersubtree,
author = {Ron Shamir and Dekel Tsur},
title = {Faster subtree isomorphism},
journal = {Journal of Algorithms},
year = {1999},
volume = {33},
pages = {267--280}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 1.5 / 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 1.5 n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O(k 1.376 n)-time algorithm for the decision problem. 1
