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

Latest revision as of 14:24, 27 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

instance of

scholarly article

0 references

title

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

0 references

28 February 2024

0 references

zbMATH Keywords

enumeration with dissimilarity

0 references

data matching

0 references

bipartite matching

0 references

dynamic programming

0 references

graph edit distance

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ins.2022.03.017

0 references

cites work

MDSM: microarray database schema matching using the Hungarian method

0 references

Q5519710

0 references

Algorithms for the Assignment and Transportation Problems

0 references

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

0 references

The auction algorithm: A distributed relaxation method for the assignment problem

0 references

Inexact graph matching for structural pattern recognition

0 references

Finding all the perfect matchings in bipartite graphs

0 references

Q4370201

0 references

Q4474103

0 references

Depth-First Search and Linear Graph Algorithms

0 references

A strong-connectivity algorithm and its applications in data flow analysis

0 references

Finding all minimum-cost perfect matchings in Bipartite graphs

0 references

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

0 references

Q4344097

0 references

Approximation of Graph Edit Distance in Quadratic Time

0 references

Hamilton Paths in Grid Graphs

0 references

Identifiers

DOI

10.1016/j.ins.2022.03.017

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6199741

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ins.2022.03.017
+Normal rank
@@ Property / OpenAlex ID @@
+W4220743156
@@ Property / OpenAlex ID: W4220743156 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q114167378
@@ Property / Wikidata QID: Q114167378 / rank @@
+Normal rank
@@ Property / cites work @@
+MDSM: microarray database schema matching using the Hungarian method
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+The auction algorithm: A distributed relaxation method for the assignment problem
+Normal rank
@@ Property / cites work @@
+Inexact graph matching for structural pattern recognition
+Normal rank
@@ Property / cites work @@
+Finding all the perfect matchings in bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q4370201
@@ Property / cites work: Q4370201 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474103
@@ Property / cites work: Q4474103 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A strong-connectivity algorithm and its applications in data flow analysis
+Normal rank
@@ Property / cites work @@
+Finding all minimum-cost perfect matchings in Bipartite graphs
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4344097
@@ Property / cites work: Q4344097 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of Graph Edit Distance in Quadratic Time
+Normal rank
@@ Property / cites work @@
+Hamilton Paths in Grid Graphs
@@ Property / cites work: Hamilton Paths in Grid Graphs / rank @@
+Normal rank