Analysis of greedy algorithms on graphs with bounded degrees (Q1417582): Difference between revisions

@@ Property / cites work @@
+Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum independent dominating sets of random cubic graphs
+Normal rank
@@ Property / cites work @@
+Maximum induced matchings of random cubic graphs
@@ Property / cites work: Maximum induced matchings of random cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence number of random cubic graphs
@@ Property / cites work: On the independence number of random cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3251608
@@ Property / cites work: Q3251608 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5843703
@@ Property / cites work: Q5843703 / rank @@
+Normal rank
@@ Property / cites work @@
+Differential equations for random processes and random graphs
+Normal rank
@@ Property / cites work @@
+Q4263664
@@ Property / cites work: Q4263664 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938890
@@ Property / cites work: Q4938890 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944970
@@ Property / cites work: Q4944970 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796200
@@ Property / cites work: Q4796200 / rank @@
+Normal rank