Top-k Densest Subgraphs Search in Temporal Graphs

The dense subgraph search problem is one of the most important graph analysis problems.It is widely used in many fields,such as the social user correlation analysis in social networks,the community discovery in the Web,etc.However,the current research focuses on searching dense subgraphs on static g...
Full description

Saved in:
Author:

MU Cong-cong, WANG Yi-shu, YUAN Ye, QIAO Bai-you, MA Yu-liang [VerfasserIn]

Format:

Electronic Article

Language:

Chinese

Published:

2021

Subjects:

densest subgraph|temporal graph|top-k query

Computer software

QA76.75-76.765

Technology (General)

T1-995

Containing Work:

In: Jisuanji kexue - Editorial office of Computer Science, 2021, 48(2021), 10, Seite 152-159

Containing Work:

volume:48 ; year:2021 ; number:10 ; pages:152-159

Links:

https://doi.org/10.11896/jsjkx.201100005 [kostenfrei]

https://doaj.org/article/d68caeef15ef416ab4a226d372c0ee09 [kostenfrei]

http://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2021-10-152.pdf [kostenfrei]

Journal toc [kostenfrei]

DOI / URN:

10.11896/jsjkx.201100005

Catalog id:

DOAJ071148272

Haven't found what you're looking for?

Contact us!