The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees
From MaRDI portal
Recommendations
Cites Work
- scientific article; zbMATH DE number 871930 (Why is no real title available?)
- An efficient algorithm for supertrees
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Reconstruction of rooted trees from subtrees
- The complexity of reconstructing trees from qualitative characters and subtrees
Cited In (6)
- The complexity of reconstructing trees from qualitative characters and subtrees
- The reducts of the homogeneous binary branching \(C\)-relation
- Solving infinite-domain CSPs using the patchwork property
- Recognising the overlap graphs of subtrees of restricted trees is hard
- Determining the consistency of partial tree descriptions
- Convex tree realizations of partitions
This page was built for publication: The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962070)