FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584): Difference between revisions

@@ Property / cites work @@
+An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
+Normal rank
@@ Property / cites work @@
+Packing non-zero \(A\)-paths in group-labelled graphs
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Multiway cuts in directed and node weighted graphs
+Normal rank
@@ Property / cites work @@
+Approximating unique games
@@ Property / cites work: Approximating unique games / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank