Why almost all \(k\)-colorable graphs are easy to color (Q968270): 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.1007/s00224-009-9231-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2170487340
@@ Property / OpenAlex ID: W2170487340 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4705349
@@ Property / cites work: Q4705349 / rank @@
+Normal rank
@@ Property / cites work @@
+Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold
+Normal rank
@@ Property / cites work @@
+On the solution-space geometry of random constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+A Spectral Technique for Coloring Random 3-Colorable Graphs
+Normal rank
@@ Property / cites work @@
+Coloring Random and Semi-Random k-Colorable Graphs
+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 @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3597150
@@ Property / cites work: Q3597150 / rank @@
+Normal rank
@@ Property / cites work @@
+Survey propagation: An algorithm for satisfiability
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3576756
@@ Property / cites work: Q3576756 / rank @@
+Normal rank
@@ Property / cites work @@
+Pairs of SAT-assignments in random Boolean formulæ
+Normal rank
@@ Property / cites work @@
+The solution of some random NP-hard problems in polynomial expected time
+Normal rank
@@ Property / cites work @@
+Zero knowledge and the chromatic number
@@ Property / cites work: Zero knowledge and the chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics for semirandom graph problems
@@ Property / cites work: Heuristics for semirandom graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
+Normal rank
@@ Property / cites work @@
+Spectral techniques applied to sparse random graphs
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+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 Random Graphs
@@ Property / cites work: Coloring Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Random I‐colorable graphs
@@ Property / cites work: Random I‐colorable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Almost all k-colorable graphs are easy to color
@@ Property / cites work: Almost all k-colorable graphs are easy to color / rank @@
+Normal rank