Please use this identifier to cite or link to this item:
Title: Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Authors: Kaneta, Yusaku
Arimura, Hiroki
Raman, Rajeev
First Published: 8-Dec-2011
Publisher: Elsevier
Citation: Journal of Discrete Algorithms, 2012, 14, pp. 119-135.
Abstract: In this paper, we consider the unordered pseudo-tree matching problem, which is a problem of, given two unordered labeled trees P and T, finding all occurrences of P in T via such many-to-one matchings that preserve node labels and parent–child relationship. This problem is closely related to the tree pattern matching problem for XPath queries with child axis only. If m>w, we present an efficient algorithm that solves the problem in O(nmlog(w)/w) time using O(hm/w+mlog(w)/w) space and O(mlog(w)) preprocessing on a unit-cost arithmetic RAM model with addition, where m is the number of nodes in P, n is the number of nodes in T, h is the height of T, and w is the word length, and we assume that w ≥logn. We also discuss a modification of our algorithm for the unordered tree homeomorphism problem, which corresponds to the tree pattern matching problem for XPath queries with descendant axis only.
DOI Link: 10.1016/j.jda.2011.12.018
ISSN: 1570-8667
eISSN: 1570-8675
Type: Journal Article
Rights: Copyright © 2011 Elsevier B.V.
Description: Metadata only entry
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
There are no files associated with this item.

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.