Listing All Maximal Cliques in Large Sparse Real-World Graphs-Reference-Cited by-同舟云学术

Listing All Maximal Cliques in Large Sparse Real-World Graphs

Published:2013-12 Issue: Volume:18 Page:
ISSN:1084-6654
Container-title:ACM Journal of Experimental Algorithmics
language:en
Short-container-title:ACM J. Exp. Algorithmics

Author:

Eppstein David¹,Löffler Maarten²,Strash Darren¹

Affiliation:

1. University of California, Irvine

2. Utrecht University

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science

Reference56 articles.

1. Scalable Parallel Algorithms for FPT Problems

2. The Enumeration of Maximal Cliques of Large Graphs

3. Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

4. Emergence of Scaling in Random Networks

5. Vladimir Batagelj and Andrej Mrvar. 2006. Pajek datasets. http://vlado.fmf.unilj.si/pub/networks/data/. Vladimir Batagelj and Andrej Mrvar. 2006. Pajek datasets. http://vlado.fmf.unilj.si/pub/networks/data/.

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

1. DuMato: An efficient warp-centric subgraph enumeration system for GPU;Journal of Parallel and Distributed Computing;2024-09

2. FRESH: Towards Efficient Graph Queries in an Outsourced Graph;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

3. Mining Quasi-Periodic Communities in Temporal Network;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

4. A two-phase approach for enumeration of maximal $$(\Delta , \gamma )$$-cliques of a temporal network;Social Network Analysis and Mining;2024-03-08

5. DeepDense: Enabling node embedding to dense subgraph mining;Expert Systems with Applications;2024-03