Finding smallest supertrees under minor containment
From MaRDI portal
Recommendations
Cites work
- Finding largest subtrees and smallest supertrees
- Graph minors. II. Algorithmic aspects of tree-width
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- On the agreement of many trees
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Ordered and Unordered Tree Inclusion
- The Parallel Complexity of Tree Embedding Problems
Cited in
(9)- Finding largest subtrees and smallest supertrees
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Constrained tree inclusion
- scientific article; zbMATH DE number 1420917 (Why is no real title available?)
- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees
- A survey on tree edit distance and related problems
- Finding smallest supertrees
- Dichotomies for tree minor containment with structural parameters
- Dichotomies for tree minor containment with structural parameters
This page was built for publication: Finding smallest supertrees under minor containment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249050)