Listing Maximal k-Plexes in Large Real-World Graphs-Reference-Cited by-同舟云学术

Listing Maximal k-Plexes in Large Real-World Graphs

Published:2022-04-25 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Web Conference 2022
language:
Short-container-title:

Author:

Wang Zhengren¹,Zhou Yi¹,Xiao Mingyu¹,Khoussainov Bakhadyr¹

Affiliation:

1. University of Electronic Science and Technology of China, China

Funder

National Natural Science Foundation of China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3485447.3512198

Reference32 articles.

1. Clique Relaxations in Social Network Analysis: The Maximumk-Plex Problem

2. Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049(2003). Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049(2003).

3. Efficient Enumeration of Maximal k-Plexes

4. Manycore clique enumeration with fast set intersections

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee;Proceedings of the ACM on Management of Data;2024-05-29

2. G²-AIMD: A Memory-Efficient Subgraph-Centric Framework for Efficient Subgraph Finding on GPUs;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

3. Efficient Maximal Temporal Plex Enumeration;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

4. Maximum k-Plex Computation: Theory and Practice;Proceedings of the ACM on Management of Data;2024-03-12

5. Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach;Proceedings of the ACM on Management of Data;2023-11-13