Deciding \(k\)-colorability in expected polynomial time (Q1847370): Difference between revisions

@@ Property / cites work @@
+Approximating the independence number via the \(\vartheta\)-function
+Normal rank
@@ Property / cites work @@
+A theoretical analysis of backtracking in the graph coloring problem
+Normal rank
@@ Property / cites work @@
+The chromatic number of random graphs
@@ Property / cites work: The chromatic number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The solution of some random NP-hard problems in polynomial expected time
+Normal rank
@@ Property / cites work @@
+Q4268434
@@ Property / cites work: Q4268434 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4519896
@@ Property / cites work: Q4519896 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate graph coloring by semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754130
@@ Property / cites work: Q2754130 / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of random graphs
@@ Property / cites work: The chromatic number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring Clique-free Graphs in Linear Expected Time
+Normal rank
@@ Property / cites work @@
+Backtrack: An O(1) expected time algorithm for the graph coloring problem
+Normal rank