Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching (Q6199741): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q114167378, #quickstatements; #temporary_batch_1722805341585 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114167378 / rank | |||
Normal rank | |||
Revision as of 23:10, 4 August 2024
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
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
