Sciweavers

Share
2 search results - page 1 / 1
» Cleaning Random d-Regular Graphs with Brooms
Sort
View
CAAN
2007
Springer
10 years 5 months ago
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
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...
Margaret-Ellen Messinger, Pawel Pralat, Richard J....
books