Page 436 - 《软件学报》2024年第6期

3012 软件学报 2024 年第 35 卷第 6 期

Algorithm Engineering and Experiments (ALENEX). San Francisco: SIAM, 2016. 138–150. [doi: 10.1137/1.9781611974317.12]
[32] Andrade DV, Resende MGC, Werneck RF. Fast local search for the maximum independent set problem. Journal of Heuristics, 2012,
18(4): 525–547. [doi: 10.1007/s10732-012-9196-4]
[33] Dahlum J, Lamm S, Sanders P, Schulz C, Strash D, Werneck RF. Accelerating local search for the maximum independent set problem. In:
Proc. of the 15th Int’l Symp. on Experimental Algorithms. St. Petersburg: Springer, 2016. 118–133. [doi: 10.1007/978-3-319-38851-9_9]
[34] Gao XY, Li JZ, Miao DJ. Dynamic approximate maximum independent set on massive graphs. In: Proc. of the 38th IEEE Int’l Conf. on
Data Engineering (ICDE). Kuala Lumpur: IEEE, 2022. 1835–1847. [doi: 10.1109/ICDE53745.2022.00183]
[35] Liu XC, Zheng WG, Chen ZY, He ZY, Wang XS. Querying maximum quasi-independent set by pay-and-recycle. In: Proc. of the 38th
IEEE Int’l Conf. on Data Engineering (ICDE). Kuala Lumpur: IEEE, 2022. 859–871. [doi: 10.1109/ICDE53745.2022.00069]
[36] Fomin FV, Grandoni F, Kratsch D. A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM, 2009, 56(5):
25. [doi: 10.1145/1552285.1552286]
[37] Chang LJ, Li W, Zhang WJ. Computing a near-maximum independent set in linear time by reducing-peeling. In: Proc. of the 2017 ACM
Int’l Conf. on Management of Data. Chicago: ACM, 2017. 1181–1196. [doi: 10.1145/3035918.3035939]
[38] Leng M, Sun L, Bian J, Ma Y. An O(m) algorithm for cores decomposition of undirected hypergrap. Journal of Chinese Computer
Systems, 2013, 34(11): 2568–2573 (in Chinese with English abstract). [doi: 10.3969/j.issn.1000-1220.2013.11.031]

附中文参考文献:
[28] 周旭东, 王丽爱, 陈崚. 启发式算法求解最大团问题研究. 计算机工程与设计, 2007, 28(18): 4329–4332. [doi: 10.3969/j.issn.1000-
7024.2007.18.002]
[29] 冯云. 一种求解图论中最大独立集问题的启发式算法. 河北省科学院学报, 2021, 38(3): 9–13. [doi: 10.16191/j.cnki.hbkx.2021.03.
002]
[38] 冷明, 孙凌宇, 边计年, 马昱春. 一种时间复杂度为O(m)的无向超图核值求解算法. 小型微型计算机系统, 2013, 34(11): 2568–2573.
[doi: 10.3969/j.issn.1000-1220.2013.11.031]

徐兰天(1997－), 男, 硕士, 主要研究领域为图数 戴永恒(1983－), 男, 博士, 工程师, 主要研究领
域为领域建模, 专家知识结构化, 融合的机器学习.
据挖掘.

李荣华(1985－), 男, 博士, 教授, CCF 专业会员, 王国仁(1966－), 男, 博士, 教授, CCF 杰出会员,
主要研究领域为大规模图数据管理与挖掘, 社交 主要研究领域为不确定数据管理, 非结构化数据
网络分析与挖掘. 管理.