An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
Research output: Contribution to journal › Journal article › Research › peer-review
| Translated title of the contribution | An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees |
|---|---|
| Original language | English |
| Journal | SIAM Journal on Computing |
| Volume | 30 |
| Issue number | 5 |
| Pages (from-to) | 1385-1404 |
| Number of pages | 20 |
| ISSN | 0097-5397 |
| Publication status | Published - 2000 |
| Externally published | Yes |
ID: 98318521