Finding influential communities in massive networks

Community search is a problem of finding densely connected subgraphs that satisfy the query conditions in a network, which has attracted much attention in recent years. However, all the previous studies on community search do not consider the influence of a community. In this paper, we introduce a n...

Celý popis

Podrobná bibliografie

Vydáno v:	The VLDB journal Ročník 26; číslo 6; s. 751 - 776
Hlavní autoři:	Li, Rong-Hua, Qin, Lu, Yu, Jeffrey Xu, Mao, Rui
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017 Springer Nature B.V
Témata:	Algorithms Communities Computer Science Data structures Database Management Regular Paper Search algorithms Supports Core decomposition Tree-shape data structure Influential community Dynamic graph I/O-efficient algorithm
ISSN:	1066-8888, 0949-877X
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!