Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

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 tr...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of discrete algorithms (Amsterdam, Netherlands) Vol. 14; pp. 119 - 135
Main Authors:	Kaneta, Yusaku, Arimura, Hiroki, Raman, Rajeev
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2012
Subjects:	Bit-parallel algorithms String matching Tree matching Unordered trees XML queries Tree matching XML queries Bit-parallel algorithms Unordered trees String matching
ISSN:	1570-8667, 1570-8675
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!