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
Importer (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ming-Yang Kao / rank
Normal rank
 
Property / author
 
Property / author: Tak-Wah Lam / rank
Normal rank
 
Property / author
 
Property / author: Hing-Fung Ting / rank
Normal rank
 
Property / author
 
Property / author: Ming-Yang Kao / rank
 
Normal rank
Property / author
 
Property / author: Tak-Wah Lam / rank
 
Normal rank
Property / author
 
Property / author: Hing-Fung Ting / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967732276 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0101010 / rank
 
Normal rank

Latest revision as of 09:12, 19 April 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
    0 references
    0 references
    0 references
    0 references
    8 April 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    labeled trees
    0 references
    evolutionary trees
    0 references
    maximum weight bipartite matchings
    0 references
    0 references
    0 references
    0 references