An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (Q2706115)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees |
scientific article |
Statements
19 March 2001
0 references
algorithms
0 references
agreement subtree
0 references
0 references
0.9390905
0 references
0.93822825
0 references
0.93691784
0 references
0.92928195
0 references
0.92767984
0 references
0 references
0 references
An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (English)
0 references
