A passage time for greedy‐coloring cycles (Q4322478): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/rsa.3240060110
+Normal rank
@@ Property / OpenAlex ID @@
+W2170107205
@@ Property / OpenAlex ID: W2170107205 / rank @@
+Normal rank
@@ Property / cites work @@
+The mean chromatic number of paths and cycles
@@ Property / cites work: The mean chromatic number of paths and cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q3825928
@@ Property / cites work: Q3825928 / rank @@
+Normal rank
@@ Property / cites work @@
+A Question of Protocol
@@ Property / cites work: A Question of Protocol / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624436
@@ Property / cites work: Q5624436 / rank @@
+Normal rank
@@ Property / cites work @@
+A Coloring Problem
@@ Property / cites work: A Coloring Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform saddlepoint approximations
@@ Property / cites work: Uniform saddlepoint approximations / rank @@
+Normal rank
@@ Property / cites work @@
+The greedy coloring is a bad probabilistic algorithm
+Normal rank
@@ Property / cites work @@
+A weibull limit for the reliability of a consecutive <i>k</i>-within-<i>m</i>-out-of-<i>n</i> system
+Normal rank