Author:
Zhu Chun-Xue,Lin Long-Long,Yuan Ping-Peng,Jin Hai
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference40 articles.
1. Chang L, Qin L. Cohesive subgraph computation over large sparse graphs. In Proc. the 35th IEEE International Conference on Data Engineering, April 2019, pp.2068-2071. https://doi.org/10.1109/ICDE.2019.00241.
2. Goldberg A V. Finding a maximum density subgraph. Technical Report, University of California Berkeley, 1984. https://digicoll.lib.berkeley.edu/record/136696, July 2022.
3. Rozenshtein P, Gionis A. Mining temporal networks. In Proc. the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2019, pp.3225-3226. https://doi.org/10.1145/3292500.3332295.
4. Lin L, Yuan P, Li R H, Wang J, Liu L, Jin H. Mining stable quasi-cliques on temporal networks. IEEE Trans. Systems, Man, and Cybernetics: Systems, 2022, 52(6): 3731-3745. https://doi.org/10.1109/TSMC.2021.3071721.
5. Li R H, Su J, Qin L, Yu J X, Dai Q. Persistent community search in temporal networks. In Proc. the 34th IEEE International Conference on Data Engineering, April 2018, pp.797-808. https://doi.org/10.1109/ICDE.2018.00077.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献