Go to DBLP homepageAn O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview