Listing All Maximal Cliques in Large Sparse Real-World Graphs 论文

2013ACM Journal of Experimental Algorithmics引用 216
Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchOptimization and Search Problems

摘要

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