Engineering Parallel Algorithms for Community Detection in Massive Networks

The amount of graph-structured data has recently experienced an enormous growth in many applications. To transform such data into useful information, fast analytics algorithms and software tools are necessary. One common graph analytics kernel is disjoint community detection (or graph clustering). D...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 27; číslo 1; s. 171 - 184
Hlavní autoři:	Staudt, Christian L., Meyerhenke, Henning
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	IEEE 01.01.2016
Témata:	Algorithm design and analysis Clustering algorithms Communities Disjoint community detection graph clustering Image edge detection Instruction sets network analysis parallel algorithm engineering parallel Louvain method Parallel processing Software algorithms network analysis Disjoint community detection parallel Louvain method parallel algorithm engineering graph clustering
ISSN:	1045-9219
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!