An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings (Q2746434): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58063049, #quickstatements; #temporary_batch_1706974288397 |
Removed claims |
||
| Property / author | |||
| Property / author: Ming-Yang Kao / rank | |||
| Property / author | |||
| Property / author: Tak-Wah Lam / rank | |||
| Property / author | |||
| Property / author: Hing-Fung Ting / rank | |||
Revision as of 14:16, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings |
scientific article |
Statements
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings (English)
0 references
8 April 2002
0 references
labeled trees
0 references
evolutionary trees
0 references
maximum weight bipartite matchings
0 references
