Faster subtree isomorphism

Ron Shamir; Dekel Tsur

Faster subtree isomorphism

Ron Shamir^*, Dekel Tsur

^*Corresponding author for this work

School of Computer Science

Tel Aviv University

Research output: Contribution to conference › Paper › peer-review

23 Scopus citations

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.5n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O(min(k^1.45n, kn^1.43))-time algorithm for the decision problem.

Original language	English
Pages	126-131
Number of pages	6
State	Published - 1997
Event	Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS - Ramat-Gan, Isr Duration: 17 Jun 1997 → 19 Jun 1997

Conference

Conference	Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS
City	Ramat-Gan, Isr
Period	17/06/97 → 19/06/97

Cite this

@conference{3467c7b146d84142858d1ada7c49da78,

title = "Faster subtree isomorphism",

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(k1.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(k1.5n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O(min(k1.45n, kn1.43))-time algorithm for the decision problem.",

author = "Ron Shamir and Dekel Tsur",

year = "1997",

language = "אנגלית",

pages = "126--131",

note = "Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS ; Conference date: 17-06-1997 Through 19-06-1997",

}

TY - CONF

T1 - Faster subtree isomorphism

AU - Shamir, Ron

AU - Tsur, Dekel

PY - 1997

Y1 - 1997

N2 - 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(k1.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(k1.5n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O(min(k1.45n, kn1.43))-time algorithm for the decision problem.

AB - 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(k1.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(k1.5n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O(min(k1.45n, kn1.43))-time algorithm for the decision problem.

UR - http://www.scopus.com/inward/record.url?scp=0030652421&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0030652421

SP - 126

EP - 131

T2 - Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS

Y2 - 17 June 1997 through 19 June 1997

ER -

Faster subtree isomorphism

Abstract

Conference

Other files and links

Fingerprint

Cite this