Constrained tree inclusion

DOI10.1007/3-540-44888-8_26zbMATH Open1279.68348OpenAlexW1535035810MaRDI QIDQ3550847FDOQ3550847

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

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

zbMATH Keywords

tree pattern matchingtree inclusionsubtree homeomorphismnoncrossing bipartite matching

Mathematics Subject Classification ID

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

Cited In (15)

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

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)