๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Yusaku Kaneta; Hiroki Arimura; Rajeev Raman


Book ID
113699087
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
450 KB
Volume
14
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Even Faster and More Unifying Algorit
โœ Ming-Yang Kao; Tak-Wah Lam; Wing-Kin Sung; Hing-Fung Ting ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 185 KB

This paper combines results of three conference papers: (1) A faster and unifying algorithm for comparing trees, in "Proceedings of the 11th Symposium on Combinatorial Pattern Matching, 2000," pp. 129-142; (2) Unbalanced and hierarchical bipartite matchings with applications to labeled tree comparis