TITLE: Lower bounds for Dominating Sets in Web Graphs

ABSTRACT: In this work we study the size of generalised dominating sets 
in graph processes that model aspects of the World Wide Web. We show 
that graphs generated in this way have fairly large dominating sets (i.e., 
linear in the size of the graph). Various results will be described 
that enable us to prove increasingly good bounds. The proof techniques we 
present may be applicable to the study of other combinatorial properties 
of web graphs. 

Joint work with Colin Cooper (Kings') and Ralf Klasing (Bordeaux).