Funder
Natural Science Foundation of China
Subject
Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference50 articles.
1. Finding all maximal cliques in dynamic graphs;Stix;Comput. Optim. Appl.,2004
2. Finding top-k maximal cliques in an uncertain graph;Zou,2010
3. Fast algorithms for maximal clique enumeration with limited memory;Cheng,2012
4. Mining maximal cliques from a large graph using mapreduce: tackling highly uneven subproblem sizes;Svendsen;J. Parallel Distrib. Comput.,2015
5. Parallelizing maximal clique enumeration over graph data;Chen,2016
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem Size;Proceedings of the 38th ACM International Conference on Supercomputing;2024-05-30
2. Parallelizing Maximal Clique Enumeration on GPUs;2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT);2023-10-21
3. Parallel K-clique counting on GPUs;Proceedings of the 36th ACM International Conference on Supercomputing;2022-06-28
4. Accelerating the Bron-Kerbosch Algorithm for Maximal Clique Enumeration Using GPUs;IEEE Transactions on Parallel and Distributed Systems;2021-09-01
5. Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs;ACM Transactions on Parallel Computing;2020-04-02