The maximum agreement subtree problem is any of several closely related problems problems in graph theory and computer science. In all of these problems one is given a collection of trees
Contents
Maximum homeomorphic agreement subtree
This version requires that the subtrees
Rooted maximum homeomorphic agreement subtree
This version is the same as the maximum homeomorphic agreement subtree, but we further assume that
Other variants
There exits other formulations for example the (rooted) maximum isomorphic agreement subtree where we require the subtrees to be isomorphic to one another.