Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm (Q5458503): Difference between revisions

@@ Property / author @@
+Richard J. Nowakowski
@@ Property / author: Richard J. Nowakowski / rank @@
+Normal rank
@@ Property / author @@
+Nicholas C. Wormald
@@ Property / author: Nicholas C. Wormald / rank @@
+Normal rank
@@ 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/978-3-540-77294-1_4
+Normal rank
@@ Property / OpenAlex ID @@
+W2162824303
@@ Property / OpenAlex ID: W2162824303 / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
+Normal rank
@@ Property / cites work @@
+Q3899968
@@ Property / cites work: Q3899968 / rank @@
+Normal rank
@@ Property / cites work @@
+Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
+Normal rank
@@ Property / cites work @@
+Q4697461
@@ Property / cites work: Q4697461 / rank @@
+Normal rank
@@ Property / cites work @@
+Cleaning a network with brushes
@@ Property / cites work: Cleaning a network with brushes / rank @@
+Normal rank
@@ Property / cites work @@
+Almost all cubic graphs are Hamiltonian
@@ Property / cites work: Almost all cubic graphs are Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of greedy algorithms on graphs with bounded degrees
+Normal rank
@@ Property / cites work @@
+Q4263664
@@ Property / cites work: Q4263664 / rank @@
+Normal rank
@@ Property / cites work @@
+The asymptotic connectivity of labelled regular graphs
+Normal rank
@@ Property / cites work @@
+Q4938890
@@ Property / cites work: Q4938890 / rank @@
+Normal rank