Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes

Author:

Svendsen Michael,Mukherjee Arko ProvoORCID,Tirthapura Srikanta

Funder

Northrop Grumman

National Science Foundation

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference46 articles.

1. Real time discovery of dense clusters in highly dynamic graphs: Identifying real world events in highly dynamic environments;Agarwal;The Proceedings of the VLDB Endowment (PVLDB),2012

2. Dense subgraph maintenance under streaming edge weight updates for real-time story identification;Angel;VLDB J.,2013

3. Densest subgraph in streaming and mapreduce;Bahmani;The Proceedings of the VLDB Endowment (PVLDB),2012

4. Algorithm 457: finding all cliques of an undirected graph;Bron;Commun. ACM,1973

5. A note on the problem of reporting maximal cliques;Cazals;Theoret. Comput. Sci.,2008

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

1. Accelerating Maximal Bicliques Enumeration with GPU on large scale network;Future Generation Computer Systems;2024-12

2. Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem Size;Proceedings of the 38th ACM International Conference on Supercomputing;2024-05-30

3. Parallelizing Maximal Clique Enumeration on GPUs;2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT);2023-10-21

4. Incremental Maximal Clique Enumeration for Hybrid Edge Changes in Large Dynamic Graphs;IEEE Transactions on Knowledge and Data Engineering;2023

5. CBLA: A Clique Based Louvain Algorithm for Detecting Overlapping Community;Procedia Computer Science;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3