Finding perfect matching cuts faster (Q6182915): Difference between revisions

@@ Property / cites work @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+Normal rank
@@ Property / cites work @@
+Matching cut in graphs with large minimum degree
@@ Property / cites work: Matching cut in graphs with large minimum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing decomposable graphs
@@ Property / cites work: Recognizing decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding matching cuts in \(H\)-free graphs
@@ Property / cites work: Finding matching cuts in \(H\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
+Normal rank
@@ Property / cites work @@
+Q4209364
@@ Property / cites work: Q4209364 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5009482
@@ Property / cites work: Q5009482 / rank @@
+Normal rank
@@ Property / cites work @@
+The perfect matching cut problem revisited
@@ Property / cites work: The perfect matching cut problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank