Sublinear Fully Distributed Partition with Applications

We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters with radius at most k −1 and having O ( n 1+1/ k ) intercluster edges. We show how to implement our algorithms in the distributed model of compu...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theory of computing systems Ročník 47; číslo 2; s. 368 - 404
Hlavní autori:	Derbel, Bilel, Mosbah, Mohamed, Zemmari, Akka
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer-Verlag 01.08.2010 Springer Nature B.V Springer Verlag
Predmet:	Algorithms Clusters Computation Computer Science Construction Decomposition Distributed processing Graphs Messages Neighborhoods Networks Other Sparsity Synchronizers Theory of Computation Sparse partition Distributed model Graph spanner Time complexity Distributed algorithm
ISSN:	1432-4350, 1433-0490
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!