Translator Disclaimer
2005 Lower Bounds and Algorithms for Dominating Sets in Web Graphs
Colin Cooper, Ralf Klasing, Michele Zito
Internet Math. 2(3): 275-300 (2005).

Abstract

In this paper we study the size of generalised dominating sets in two graph processes that are widely used to model aspects of the World Wide Web. On the one hand, we show that graphs generated this way have fairly large dominating sets (i.e., linear in the size of the graph). On the other hand, we present efficient strategies to construct small dominating sets.

The algorithmic results represent an application of a particular analysis technique which can be used to characterise the asymptotic behaviour of a number of dynamic processes related to the web.

Citation

Download Citation

Colin Cooper. Ralf Klasing. Michele Zito. "Lower Bounds and Algorithms for Dominating Sets in Web Graphs." Internet Math. 2 (3) 275 - 300, 2005.

Information

Published: 2005
First available in Project Euclid: 16 June 2006

zbMATH: 1110.68095
MathSciNet: MR2212367

Rights: Copyright © 2005 A K Peters, Ltd.

JOURNAL ARTICLE
26 PAGES


SHARE
Vol.2 • No. 3 • 2005
Back to Top