Listing All Maximal Cliques in Large Sparse Real-World Graphs

2013/11/28 by David Eppstein, Maarten Löffler, Darren Strash · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Optimization and Search Problems #Listing (finance) #Citation #Computer science #World Wide Web #Business #Finance

paper · doi:10.1145/2543629

openalex publication_date 2013/11/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

research-article Share on Listing All Maximal Cliques in Large Sparse Real-World Graphs Authors: David Eppstein University of California, Irvine University of California, IrvineView Profile , Maarten Löffler Utrecht University Utrecht UniversityView Profile , Darren Strash University of California, Irvine University of California, IrvineView Profile Authors Info & Claims ACM Journal of Experimental AlgorithmicsVolume 182013 Article No.: 3.1pp 3.1–3.21https://doi.org/10.1145/2543629Published:28 November 2013Publication History 86citation824DownloadsMetricsTotal Citations86Total Downloads824Last 12 Months114Last 6 weeks9 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Citations

• Community structure in social and biological networks
• The dynamics of viral marketing
• Emergence of scaling in random networks
• On cliques in graphs
• Vertex similarity in networks
• Arboricity and Subgraph Listing Algorithms
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations
• Algorithm 457: finding all cliques of an undirected graph
• A graph-theoretic algorithm for comparative modeling of protein structure
• A Procedure for Clique Detection Using the Group Matrix

Cited by

• Near-Optimal Algorithms for Maximal Clique Enumeration in Structurally Sparse Graphs
• Mining Maximal Cliques from an Uncertain Graph
• Clique problem [wikipedia]

Related

• Listing All Maximal Cliques in Large Sparse Real-World Graphs
• Finding Maximum Cliques in Large Networks
• Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
• Aggregating maximal cliques in real-world graphs
• Parallel Maximum Clique Algorithms with Applications to Network Analysis and Storage