The Maximal Agreement Subtree problem for random trees
Budzinski
Thomas
Consider two binary trees whose leaves are labelled from 1 to n.
Mon compte
Pas encore inscrit ?
Consider two binary trees whose leaves are labelled from 1 to n.