Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
DOI10.1016/J.INS.2022.03.017OpenAlexW4220743156WikidataQ114167378 ScholiaQ114167378MaRDI QIDQ6199741FDOQ6199741
Authors: David B. Blumenthal, Sébastien Bougleux, Anton Dignös, Johann Gamper 
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
Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) General topics of discrete mathematics in relation to computer science (68R01)
Cites Work
- MDSM: microarray database schema matching using the Hungarian method
- The auction algorithm: A distributed relaxation method for the assignment problem
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Depth-First Search and Linear Graph Algorithms
- Finding all the perfect matchings in bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamilton Paths in Grid Graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A strong-connectivity algorithm and its applications in data flow analysis
- Algorithms for the Assignment and Transportation Problems
- Finding all minimum-cost perfect matchings in Bipartite graphs
- Inexact graph matching for structural pattern recognition
- Approximation of Graph Edit Distance in Quadratic Time
This page was built for publication: Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199741)
