An improved kernelization for \(P_{2}\)-packing (Q991748): Difference between revisions

@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Deterministic Algorithms for Weighted Matching and Packing Problems
+Normal rank
@@ Property / cites work @@
+A parameterized perspective on packing paths of length two
+Normal rank
@@ Property / cites work @@
+On the completeness of a generalized matching problem
+Normal rank
@@ Property / cites work @@
+On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
+Normal rank
@@ Property / cites work @@
+Maximum bounded \(H\)-matching is Max SNP-complete
+Normal rank
@@ Property / cites work @@
+On the Complexity of General Graph Factor Problems
+Normal rank
@@ Property / cites work @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Looking at the stars
@@ Property / cites work: Looking at the stars / rank @@
+Normal rank