Lower Bounds and Algorithms for Dominating Sets in Web Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Lower Bounds and Algorithms for Dominating Sets in Web Graphs

Abstract

In this paper we study the size of dominating sets, and their generalizations, in two graph processes which are widely used to model aspects of the world-wide web. In these processes each new vertex connects to the existing graph by a constant number, $m$, of edges. The terminal vertices of these edges are chosen uniformly at random or by preferential attachment depending on the process. We show that almost all such graph processes have minimal dominating sets linear in the size of the graph and give bounds for this size as a function of $m$. We obtain the upper bounds from simple on-line algorithms for dominating sets. The lower bounds are obtained by proving that the lexicographically first set of a given size is the most likely to dominate.
Fichier principal
Vignette du fichier
RR-5529.pdf (331.51 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070478 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070478 , version 1

Cite

Colin Cooper, Ralf Klasing, Michele Zito. Lower Bounds and Algorithms for Dominating Sets in Web Graphs. [Research Report] RR-5529, INRIA. 2006, pp.26. ⟨inria-00070478⟩
334 View
213 Download

Share

Gmail Facebook Twitter LinkedIn More