2 search results - page 1 / 1 » Cleaning Random d-Regular Graphs with Brooms |
GC
2011
Springer
12 years 8 months ago
2011
Springer
CAAN
2007
Springer
13 years 10 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...