Parallel Algorithm for Enumerating Maximal Cliques in Complex Network

DOI10.1007/978-3-540-88067-7_12MaRDI QIDQ3627914zbMATH OpenOpenAlexFDO

Authors Nan du, Bin Wu, 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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel maximum clique algorithms with applications to network analysis
• A parallel maximum clique algorithm for large and massive sparse graphs
• scientific article; zbMATH DE number 4072403
• scientific article; zbMATH DE number 1728440
• A parallel implementation for the maximum clique problem
• scientific article; zbMATH DE number 1424217
• Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
• Efficiently enumerating all maximal cliques with bit-parallelism
• About parallelization of an algorithm for the maximum clique problem
• Distributed algorithms for maximum cliques

Cites work

• A New Algorithm for Generating All the Maximal Independent Sets
• Algorithm 457: finding all cliques of an undirected graph
• Algorithm Theory - SWAT 2004
• On generating all maximal independent sets
• On the complexity of multi-parameterized cluster editing
• Statistical mechanics of complex networks
• The worst-case time complexity for generating all maximal cliques and computational experiments

Cited in

(12)

• Multi-threading a state-of-the-art maximum clique algorithm
• Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
• Exploiting the formation of maximal cliques in social networks
• On the computation of fixed points in Boolean networks
• scientific article; zbMATH DE number 1728440 (Why is no real title available?)
• scientific article; zbMATH DE number 5863491 (Why is no real title available?)
• scientific article; zbMATH DE number 5669599 (Why is no real title available?)
• Parallel maximum clique algorithms with applications to network analysis
• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
• Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
• A parallel maximum clique algorithm for large and massive sparse graphs
• Refined pivot selection for maximal clique enumeration in graphs

This page was built for publication: Parallel Algorithm for Enumerating Maximal Cliques in Complex Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3627914)