Constrained weighted matchings and edge coverings in graphs (Q1304484): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145800
@@ Property / cites work: Q3145800 / rank @@
+Normal rank
@@ Property / cites work @@
+The \(k\)-cardinality assignment problem
@@ Property / cites work: The \(k\)-cardinality assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A shortest augmenting path algorithm for dense and sparse linear assignment problems
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3751373
@@ Property / cites work: Q3751373 / rank @@
+Normal rank
@@ Property / cites work @@
+A 1-matching blossom-type algorithm for edge covering problems
+Normal rank
@@ Property / cites work @@
+Equivalence between the minimum covering problem and the maximum matching problem
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for minimumk-covers in weighted graphs
+Normal rank