An exact algorithm for MAX-CUT in sparse graphs (Q2467485): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2006.04.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2039389937
@@ Property / OpenAlex ID: W2039389937 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4500843
@@ Property / cites work: Q4500843 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
+Normal rank
@@ Property / cites work @@
+Three short proofs in graph theory
@@ Property / cites work: Three short proofs in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4840774
@@ Property / cites work: Q4840774 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on greedy algorithms for the maximum weighted independent set problem
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+A new algorithm for optimal 2-constraint satisfaction and its implications
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank