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á bibliografia

Vydané v:	The VLDB journal Ročník 26; číslo 6; s. 751 - 776
Hlavní autori:	Li, Rong-Hua, Qin, Lu, Yu, Jeffrey Xu, Mao, Rui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017 Springer Nature B.V
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!