Distributed algorithms for random graphs

In this article we study statistical properties of a commonly used network model – an Erdős–Rényi random graph G(n,p). We are interested in the performance of distributed algorithms on large networks, which might be represented by G(n,p). We concentrate on classical problems from the field of distri...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 605; s. 95 - 105
Hlavní autori: Krzywdziński, K., Rybarczyk, K.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 09.11.2015
Predmet:
Algorithms
Approximation
Colouring
Distributed algorithms
Dominating set
Graph theory
Graphs
Independent set
Matching
Mathematical analysis
Networks
Random graphs
Matching
Independent set
Colouring
Dominating set
Random graphs
Distributed algorithms
ISSN:0304-3975, 1879-2294
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this article we study statistical properties of a commonly used network model – an Erdős–Rényi random graph G(n,p). We are interested in the performance of distributed algorithms on large networks, which might be represented by G(n,p). We concentrate on classical problems from the field of distributed algorithms such as: finding a maximal independent set, a vertex colouring, an approximation of a minimum dominating set, a maximal matching, an edge colouring and an approximation of a maximum matching. We propose new algorithms, which with probability close to one as n→∞ construct anticipated structures in G(n,p) in a low number of rounds. Moreover, in some cases, we modify known algorithms to obtain better efficiency on G(n,p).
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2015.08.037