Li, Y., Dai, J., Fan, X., Zhao, Y., & Wang, G. (2022). I/O Efficient Early Bursting Cohesive Subgraph Discovery in Massive Temporal Networks. Journal of computer science and technology, 37(6), 1337-1355. https://doi.org/10.1007/s11390-022-2367-3
Chicago Style (17th ed.) CitationLi, Yuan, Jie Dai, Xiao-Lin Fan, Yu-Hai Zhao, and Guo-Ren Wang. "I/O Efficient Early Bursting Cohesive Subgraph Discovery in Massive Temporal Networks." Journal of Computer Science and Technology 37, no. 6 (2022): 1337-1355. https://doi.org/10.1007/s11390-022-2367-3.
MLA (9th ed.) CitationLi, Yuan, et al. "I/O Efficient Early Bursting Cohesive Subgraph Discovery in Massive Temporal Networks." Journal of Computer Science and Technology, vol. 37, no. 6, 2022, pp. 1337-1355, https://doi.org/10.1007/s11390-022-2367-3.