Parallel Graph Partitioning for Complex Networks

Processing large complex networks like social networks or web graphs has attracted considerable interest. To do this in parallel, we need to partition them into pieces of roughly equal size. Unfortunately, previous parallel graph partitioners originally developed for more regular mesh-like networks...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 28; číslo 9; s. 2625 - 2638
Hlavní autoři:	Meyerhenke, Henning, Sanders, Peter, Schulz, Christian
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.09.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	algorithm design and analysis Clustering Clustering algorithms Clusters Coarsening combinatorial algorithms Complex networks Evolutionary algorithms Evolutionary computation graph algorithms Graph theory Load balancing and task assignment Multilevel Parallel processing Partitioning Partitioning algorithms Partitions Propagation Social network services Social networks Sociology Statistics Structural hierarchy
ISSN:	1045-9219, 1558-2183
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!