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

DOI10.1016/j.ins.2022.03.017OpenAlexW4220743156WikidataQ114167378 ScholiaQ114167378MaRDI QIDQ6199741

Johann Gamper, David B. Blumenthal, Sébastien Bougleux, Anton Dignös

Publication date: 28 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2022.03.017

zbMATH Keywords

dynamic programmingbipartite matchinggraph edit distancedata matchingenumeration with dissimilarity

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strong-connectivity algorithm and its applications in data flow analysis
• The auction algorithm: A distributed relaxation method for the assignment problem
• Finding all the perfect matchings in bipartite graphs
• MDSM: microarray database schema matching using the Hungarian method
• Algorithms for the Assignment and Transportation Problems
• Approximation of Graph Edit Distance in Quadratic Time
• Finding all minimum-cost perfect matchings in Bipartite graphs
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Hamilton Paths in Grid Graphs
• Inexact graph matching for structural pattern recognition
• Depth-First Search and Linear Graph Algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching