Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

ISTCS
1997
Springer

favoriteEmaildiscussreport

278views Applied Computing» more ISTCS 1997»

Faster subtree isomorphism

13 years 8 months ago

Faster subtree isomorphism

Download www.cs.bgu.ac.il

We study the subtree isomorphism problem: Given trees H and G, ﬁnd a subtree of G which is isomorphic to H or decide that there is no

Ron Shamir, Dekel Tsur

Real-time Traffic

Applied Computing | Isomorphism | ISTCS 1997 | Subtree Isomorphism Problem |

claim paper

Related Content

» Approximating the Maximum Isomorphic Agreement Subtree Is Hard

» PolynomialTime Algorithms for the Ordered Maximum Agreement Subtree Problem

» An On log n Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

» Faster Checking of Software Specifications by Eliminating Isomorphs

» Faster Unfolding of General Petri Nets Based on Token Flows

» Faster algorithms for guided tree edit distance

» Mining Maximal Frequently Changing Subtree Patterns from XML Documents

» Fast Alignments of Metabolic Networks

» Tree Automata with Global Constraints

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1997
Where	ISTCS
Authors	Ron Shamir, Dekel Tsur

Comments (0)