2004 | OriginalPaper | Buchkapitel
Dominating Sets in Web Graphs
verfasst von : Colin Cooper, Ralf Klasing, Michele Zito
Erschienen in: Algorithms and Models for the Web-Graph
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we study the size of generalised dominating sets in two graph processes which 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.