Algorithms solving the matching cut problem (Q897900): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+The complexity of the matching-cut problem for planar graphs and other graph classes
+Normal rank
@@ Property / cites work @@
+Matching cutsets in graphs of diameter 2
@@ Property / cites work: Matching cutsets in graphs of diameter 2 / rank @@
+Normal rank
@@ Property / cites work @@
+On stable cutsets in graphs
@@ Property / cites work: On stable cutsets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph decomposition of slim graphs
@@ Property / cites work: Graph decomposition of slim graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fragile graphs with small independent cuts
@@ Property / cites work: Fragile graphs with small independent cuts / rank @@
+Normal rank
@@ Property / cites work @@
+A note on fragile graphs
@@ Property / cites work: A note on fragile graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing decomposable graphs
@@ Property / cites work: Recognizing decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Stable set bonding in perfect graphs and parity graphs
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Networks immune to isolated line failures
@@ Property / cites work: Networks immune to isolated line failures / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393307
@@ Property / cites work: Q4393307 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms Solving the Matching Cut Problem
@@ Property / cites work: Algorithms Solving the Matching Cut Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
+Normal rank
@@ Property / cites work @@
+On stable cutsets in claw-free graphs and planar graphs
+Normal rank
@@ Property / cites work @@
+On stable cutsets in line graphs
@@ Property / cites work: On stable cutsets in line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal graphs having no stable cutset
@@ Property / cites work: Extremal graphs having no stable cutset / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching cutsets in graphs
@@ Property / cites work: Matching cutsets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448767
@@ Property / cites work: Q4448767 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring graphs with stable cutsets
@@ Property / cites work: Coloring graphs with stable cutsets / rank @@
+Normal rank