An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings (Q2746434)

From MaRDI portal
Revision as of 00:28, 16 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    labeled trees
    0 references
    evolutionary trees
    0 references
    maximum weight bipartite matchings
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references