The sweeping model of searching graphs and digraphs Danny Dyer, Simon Fraser, and Boting Yang, U Regina We will be introducing the basic problem of sweeping, as well as the restrictions that give monotonic and connected sweeping, and look at the relationships between the various sweep numbers. We will do this by introducing a variety of lower bounds to sweep number, using the graph parameters minimum degree, girth, clique number, and chromatic number. We will also discuss four models for sweeping directed graphs, looking at the relationship between the various sweep numbers. We will characterize 1-sweepable graphs for each of the sweep models, and look at some bounds on these sweep numbers, using graph parameters such as size of a minimum feedback set, path number, size of a maximum transitive subtournament, and reversability index.