An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings (Q2746434)
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 even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings |
scientific article; zbMATH DE number 1656030
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings |
scientific article; zbMATH DE number 1656030 |
Statements
8 April 2002
0 references
labeled trees
0 references
evolutionary trees
0 references
maximum weight bipartite matchings
0 references
An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings (English)
0 references
