Incremental k-core decomposition: algorithms and evaluation

A k -core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k -core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, visualization, and solving NP-hard problems o...

Celý popis

Podrobná bibliografia

Vydané v:	The VLDB journal Ročník 25; číslo 3; s. 425 - 447
Hlavní autori:	Sarıyüce, Ahmet Erdem, Gedik, Buğra, Jacques-Silva, Gabriela, Wu, Kun-Lung, Çatalyürek, Ümit V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2016
Predmet:	Computer Science Database Management Regular Paper Dense subgraph discovery Streaming graph algorithms Incremental graph algorithms Core
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!