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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The VLDB journal Jg. 26; H. 6; S. 751 - 776
Hauptverfasser:	Li, Rong-Hua, Qin, Lu, Yu, Jeffrey Xu, Mao, Rui
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!