Page 169 - 《软件学报》2020年第12期

潘敏佳 等:面向时序图数据的快速环枚举算法 3835

[2] Hoffmann F, Krasle D. Fraud detection using network analysis. 2015. EP Patent App. EP20,140,003,010.
[3] Holme P, Sarama¨ki J. Temporal networks. Physics Reports, 2012,519(3):97−125.
[4] Wang YS, Yuan Y, Liu M. Survey of query processing and mining techniques over large temporal graph database. Journal of
Computer Research and Development, 2018,55(9):1889−1902 (in Chinese with English abstract).
[5] Jiang ZH. Minging frequent evolution pattern on temporal network. Modern Computer, 2019,638(2):15−19 (in Chinese with
English abstract).
[6] Wu AB, Yuan Y, Qiao BY, Wang YS, Ma YL, Wang GR. The influence maximization problem based on large-scale temporal
graph. Chinese Journal of Computers, 2019:1−18 (in Chinese with English abstract).
[7] Kovanen L, Karsai M, Kaski K, Kert´esz J, Sarama¨ki J. Temporal motifs in time-dependent networks. Journal of Statistical
Mechanics: Theory and Experiment, 2011(11):P11005, 2011.
[8] Paranjape A, Benson AR, Leskovec J. Motifs in temporal networks. In: Proc. of the 10th ACM Int’l Conf. on Web Search and Data
Mining. ACM, 2017. 601−610.
[9] Rao VVB, Murti VGK. Enumeration of all circuits of a graph. Proc. of the IEEE, 1969,57(4):700−701.
[10] Ponstein J. Self-Avoiding paths and the adjacency matrix of a graph. SIAM Journal on Applied Mathematics, 1966,14(3):600−609.
[11] Mateti P, Deo N. On algorithms for enumerating all circuits of a graph. SIAM Journal on Computing, 1976,5(1):90−99.
[12] Tiernan JC. An efficient search algorithm to find the elementary circuits of a graph. Communications of the ACM, 1970,13(12):
722−726.
[13] Weinblatt H. A new search algorithm for finding the simple cycles of a finite directed graph. Journal of the ACM (JACM), 1972,
19(1):43−56.
[14] Johnson DB. Finding all the elementary circuits of a directed graph. SIAM Journal on Computing, 1975,4(1):77−84.
[15] Birmelé E, Ferreira R, Grossi R, et al. Optimal listing of cycles and st-paths in undirected graphs. In: Proc. of the 24th Annual
ACM-SIAM Symp. on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2013. 1884−1896.
[16] Qiu X, Cen W, Qian Z, et al. Real-Time constrained cycle detection in large dynamic graphs. Proc. of the VLDB Endowment, 2018,
11(12):1876−1888.
[17] Kumar R, Calders T. Finding simple temporal cycles in an interaction network. In: Proc. of the Workshop on Large-Scale Time
Dependent Graphs (TD-LSG 2017), Co-Located with the European Conf. on Machine Learning and Principles and Practice of
Knowledge Discovery in Databases (ECML PKDD 2017). Skopje, 2017. 3−6.
[18] Kumar R, Calders T. 2SCENT: An efficient algorithm for enumerating all simple temporal cycles. Proc. of the VLDB Endowment,
2018,11(11):1441−1453.
[19] Bloom BH. Space/Time trade-offs in hash coding with allowable errors. Communications of the ACM, 1970,13(7):422−426.
[20] Leskovec J, Krevl A. SNAP datasets: Stanford large network dataset collection. 2014. https://snap.stanford.edu/data

附中文参考文献:
[4] 王一舒,袁野,刘萌.大规模时序图数据的查询处理与挖掘技术综述.计算机研究与发展,2018,55(9):1889−1902.
[5] 蒋志恒.时序网络的频繁演化模式挖掘.现代计算机(专业版),2019,638(2):17−21.
[6] 吴安彪,袁野,乔百友,王一舒,马玉亮,王国仁.大规模时序图影响力最大化的算法研究.计算机学报,2019:1−18.

潘敏佳(1996－),女,硕士,CCF 学生会员, 赵宇海(1975－),男,博士,教授,博士生导
主要研究领域为图数据挖掘. 师,CCF 高级会员,主要研究领域为数据
库,数据挖掘,机器学习,软件工程,生物信
息学.

李荣华(1985－),男,博士,副教授,博士生 王国仁(1966－),男,博士,教授,博士生导
导师,CCF 专业会员,主要研究领域为图数 师,CCF 杰出会员,主要研究领域为不确定
据管理,图数据挖掘,社交网络分析,图机 数据管理,数据密集型计算,可视媒体数据
器学习,图计算系统. 管理与分析,非结构化数据管理,分布式查
询处理与优化技术(主要包括传感器网络
和 P2P 对等计算),生物信息学.