Constrained tree inclusion
From MaRDI portal
Publication:3550847
Recommendations
Cited in
(15)- A top down algorithm for constrained tree inclusion
- Bottom-up subtree isomorphism for unordered labeled trees
- Matching Subsequences in Trees
- Ordered and Unordered Tree Inclusion
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Matching subsequences in trees
- On the tree inclusion problem
- Approximate labelled subtree homeomorphism
- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
- Tree inclusions in windows and slices
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- Constrained tree inclusion
- Combinatorial Pattern Matching
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- New and improved algorithms for unordered tree inclusion
This page was built for publication: Constrained tree inclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550847)