I/O Efficient Early Bursting Cohesive Subgraph Discovery in Massive Temporal Networks

Temporal networks are an effective way to encode temporal information into graph data losslessly. Finding the bursting cohesive subgraph (BCS), which accumulates its cohesiveness at the fastest rate, is an important problem in temporal networks. The BCS has a large number of applications, such as re...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer science and technology Vol. 37; no. 6; pp. 1337 - 1355
Main Authors:	Li, Yuan, Dai, Jie, Fan, Xiao-Lin, Zhao, Yu-Hai, Wang, Guo-Ren
Format:	Journal Article
Language:	English
Published:	Singapore Springer Nature Singapore 01.12.2022 Springer Springer Nature B.V School of Computer Science and Engineering,Northeastern University,Shenyang 110169,China%School of Computer Science and Engineering,Northeastern University,Shenyang 110169,China%School of Computer,Beijing Institute of Technology,Beijing 100081,China School of Information Science and Technology,North China University of Technology,Beijing 100144,China%School of Information Science and Technology,North China University of Technology,Beijing 100144,China
Subjects:	Algorithms Analysis Artificial Intelligence Bursting Cohesion Computer Science Data Structures and Information Theory Epidemics Football (College) Graph theory Information Systems Applications (incl.Internet) Networks Regular Paper Roads & highways Run time (computers) Search algorithms Software Engineering Theory of Computation Traffic congestion early bursting cohesive subgraph (EBCS) I/O efficient algorithm temporal network semi-external model early bursting cohesive subgraph(EBCS)
ISSN:	1000-9000, 1860-4749
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!