Constrained tree inclusion

DOI10.1016/J.JDA.2004.08.017MaRDI QIDQ2569419zbMATH OpenOpenAlexFDO

Authors Gabriel Valiente

Publication date 27 October 2005

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2004.08.017

zbMATH Keywords

combinatorial algorithmsnoncrossing bipartite matchingsubtree homeomorphismsubtree isomorphismtree inclusiontree pattern matching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

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

Cites work

• A note on the subtree isomorphism for ordered trees and related problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An Analysis of a Good Algorithm for the Subtree Problem
• An Analysis of a Good Algorithm for the Subtree Problem, Corrected
• Combinatorial Pattern Matching
• Constrained tree inclusion
• Efficient labelling algorithms for the maximum noncrossing matching problem
• Efficient randomized pattern-matching algorithms
• Fast Pattern Matching in Strings
• Faster Subtree Isomorphism
• Finding smallest supertrees under minor containment
• Further comments on the subtree isomorphism for ordered trees
• scientific article; zbMATH DE number 3497312 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1820633 (Why is no real title available?)
• More Efficient Algorithm for Ordered Tree Inclusion
• O(n2.5) time algorithms for the subgraph homeomorphism problem on trees
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• On the subtree isomorphism problem for ordered trees
• On the tree inclusion problem
• Optimal canonization of all substrings of a string
• Ordered and Unordered Tree Inclusion
• Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs
• Some comments on the subtree isomorphism problem for ordered trees
• Strings, trees, and patterns
• Subtree Isomorphism in O(n5/2)

Cited in

(13)

• New and improved algorithms for unordered tree inclusion
• Generalized LCS
• An algebraic view of the relation between largest common subtrees and smallest common supertrees
• scientific article; zbMATH DE number 1638647 (Why is no real title available?)
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Tree inclusion problems
• Constrained tree inclusion
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• A top down algorithm for constrained tree inclusion
• scientific article; zbMATH DE number 7561381 (Why is no real title available?)
• Algorithms for finding a most similar subforest
• Tree inclusions in windows and slices
• A new tree inclusion algorithm

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 Q2569419)