An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees (Q2706115)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees |
scientific article |
Statements
An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees (English)
0 references
19 March 2001
0 references
algorithms
0 references
agreement subtree
0 references
