Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
From MaRDI portal
Publication:3627914
DOI10.1007/978-3-540-88067-7_12zbMath1171.68855MaRDI QIDQ3627914
Bin Wu, Nan du, Liutong Xu, Bai Wang, Pei Xin
Publication date: 13 May 2009
Published in: Studies in Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88067-7_12
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Exploiting the formation of maximal cliques in social networks, On the computation of fixed points in Boolean networks, Parallel Maximum Clique Algorithms with Applications to Network Analysis
Cites Work
- The worst-case time complexity for generating all maximal cliques and computational experiments
- On generating all maximal independent sets
- On the complexity of multi-parameterized cluster editing
- Statistical mechanics of complex networks
- A New Algorithm for Generating All the Maximal Independent Sets
- Algorithm Theory - SWAT 2004
- Algorithm 457: finding all cliques of an undirected graph