Faster tree pattern matching

Authors:
M. Dubiner;Z. Galil;E. Magen
Affiliations:
Dept. of Appl. Math., Tel-Aviv Univ., Israel;-;-
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 3

Finding Smallest Supertrees Under Minor Containment

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A tree matching chip

VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
The tree inclusion problem: In linear space and faster

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, R. Kosaraju (Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, p.178-83) gave an O(nm/sup 0.75/ polylog(m))-step algorithm for tree pattern matching. The authors improve this result by designing a simple O(n square root m polylog (m)) algorithm.