Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088): Difference between revisions

@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+Some Extremal Properties of Bipartite Subgraphs
@@ Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds on <i>k</i>‐independence
@@ Property / cites work: Improved lower bounds on <i>k</i>‐independence / rank @@
+Normal rank
@@ Property / cites work @@
+Graph coloring in linear time
@@ Property / cites work: Graph coloring in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+How to make a graph bipartite
@@ Property / cites work: How to make a graph bipartite / rank @@
+Normal rank
@@ Property / cites work @@
+A note on bipartite subgraphs of triangle‐free graphs
+Normal rank