A simple approximation algorithm for the weighted matching problem (Q1007528): Difference between revisions

@@ Property / cites work @@
+Computing Minimum-Weight Perfect Matchings
@@ Property / cites work: Computing Minimum-Weight Perfect Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+Normal rank
@@ Property / cites work @@
+Complexity and modeling aspects of mesh refinement into quadrilaterals
+Normal rank
@@ Property / cites work @@
+Quality matching and local improvement for multilevel graph-partitioning
+Normal rank
@@ Property / cites work @@
+Q4251057
@@ Property / cites work: Q4251057 / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(02)00393-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2024607148
@@ Property / OpenAlex ID: W2024607148 / rank @@
+Normal rank