Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching (Q6199741)

From MaRDI portal
Revision as of 14:24, 27 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7810768
Language Label Description Also known as
English
Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
scientific article; zbMATH DE number 7810768

    Statements

    Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 February 2024
    0 references
    enumeration with dissimilarity
    0 references
    data matching
    0 references
    bipartite matching
    0 references
    dynamic programming
    0 references
    graph edit distance
    0 references

    Identifiers

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