Faster Subtree Isomorphism

Ron Shamir; Dekel Tsur

doi:10.1006/jagm.1999.1044

Faster Subtree Isomorphism

Ron Shamir^*, Dekel Tsur

^*Corresponding author for this work

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

90 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(k^1.376n)-time algorithm for the decision problem.

Original language	English
Pages (from-to)	267-280
Number of pages	14
Journal	Journal of Algorithms
Volume	33
Issue number	2
DOIs	https://doi.org/10.1006/jagm.1999.1044
State	Published - Nov 1999

Access to Document

10.1006/jagm.1999.1044

Cite this

@article{4de0e3b298184274b95c8737ad656d96,

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(k1.376n)-time algorithm for the decision problem.",

author = "Ron Shamir and Dekel Tsur",

year = "1999",

month = nov,

doi = "10.1006/jagm.1999.1044",

language = "אנגלית",

volume = "33",

pages = "267--280",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Faster Subtree Isomorphism

AU - Shamir, Ron

AU - Tsur, Dekel

PY - 1999/11

Y1 - 1999/11

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(k1.376n)-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(k1.376n)-time algorithm for the decision problem.

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

U2 - 10.1006/jagm.1999.1044

DO - 10.1006/jagm.1999.1044

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0242614382

SN - 0196-6774

VL - 33

SP - 267

EP - 280

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 2

ER -

Faster Subtree Isomorphism

Abstract

Access to Document

Other files and links

Fingerprint

Cite this