Finding largest subtrees and smallest supertrees
From MaRDI portal
Recommendations
Cited in
(21)- On finding common subtrees
- A fast discovery algorithm for large common connected induced subgraphs
- Comparing and distinguishing the structure of biological branching
- Maximum agreement and compatible supertrees
- A management system for decompositions in stochastic programming
- Approximate matching for two families of trees
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Finding largest common embeddable subtrees
- Finding smallest supertrees under minor containment
- scientific article; zbMATH DE number 1439439 (Why is no real title available?)
- Largest Weight Common Subtree Embeddings with Distance Penalties
- Finding smallest supertrees under minor containment
- Fixed-Parameter Algorithms for Finding Agreement Supertrees
- A survey on tree edit distance and related problems
- On the parameterized complexity of the multi-MCT and multi-MCST problems
- Finding smallest supertrees
- Dichotomies for tree minor containment with structural parameters
- Dichotomies for tree minor containment with structural parameters
- Isometric-universal graphs for trees
- Exact enumeration of all connected maximum common subgraphs in multiple labeled graphs: application to cheminformatics
- Subtree isomorphism is in random NC
This page was built for publication: Finding largest subtrees and smallest supertrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387834)
