Constrained tree inclusion

DOI10.1007/3-540-44888-8_26MaRDI QIDQ3550847zbMATH OpenOpenAlexFDO

Authors Gabriel Valiente

Publication date 6 April 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44888-8_26

zbMATH Keywords

noncrossing bipartite matchingsubtree homeomorphismtree inclusiontree pattern matching

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Constrained tree inclusion
• Ordered and Unordered Tree Inclusion
• More Efficient Algorithm for Ordered Tree Inclusion
• A top down algorithm for constrained tree inclusion
• New and improved algorithms for unordered tree inclusion

Cited in

(15)

• Approximate labelled subtree homeomorphism
• Matching subsequences in trees
• New and improved algorithms for unordered tree inclusion
• An algebraic view of the relation between largest common subtrees and smallest common supertrees
• Constrained tree inclusion
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
• Matching Subsequences in Trees
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Ordered and Unordered Tree Inclusion
• A top down algorithm for constrained tree inclusion
• Bottom-up subtree isomorphism for unordered labeled trees
• Combinatorial Pattern Matching
• On the tree inclusion problem
• Tree inclusions in windows and slices

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)