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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of computer science and technology Ročník 37; číslo 6; s. 1337 - 1355
Hlavní autoři:	Li, Yuan, Dai, Jie, Fan, Xiao-Lin, Zhao, Yu-Hai, Wang, Guo-Ren
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	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
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!