Enumerating maximal cliques in large sparse graphs

DOI10.13245/J.HUST.171201MaRDI QIDQ4688314zbMATH OpenFDO

Authors Kun He, Shenghao Zou, Jianrong Zhou

Publication date 22 October 2018

Full work available at URL https://doi.org/10.13245/J.HUST.171201

zbMATH Keywords

greedy coloring algorithmlarge sparse graphsmaximal clique enumerationMaxSAT reasoning algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Listing all maximal cliques in large sparse real-world graphs
• Algorithm Theory - SWAT 2004
• Fast maximal cliques enumeration in sparse graphs
• A linear time algorithm for maximal clique enumeration in large sparse graphs
• Fast algorithms for the maximum clique problem on massive sparse graphs

Cited in

(21)

• Enumeration aspects of maximal cliques and bicliques
• Finding all maximal cliques in dynamic graphs
• Efficiently enumerating all maximal cliques with bit-parallelism
• Fast maximal cliques enumeration in sparse graphs
• Computing maximum \(k\)-defective cliques in massive graphs
• Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
• A linear time algorithm for maximal clique enumeration in large sparse graphs
• Finding top-N colossal patterns based on clique search with dynamic update of graph
• scientific article; zbMATH DE number 2086259 (Why is no real title available?)
• Parallel maximum clique algorithms with applications to network analysis
• On CLIQUE Problem for Sparse Graphs of Large Dimension
• scientific article; zbMATH DE number 1500539 (Why is no real title available?)
• scientific article; zbMATH DE number 1424314 (Why is no real title available?)
• On maximal cliques with connectivity constraints in directed graphs
• Listing all maximal cliques in large sparse real-world graphs
• Algorithm Theory - SWAT 2004
• A Continuous-Based Approach for Partial Clique Enumeration
• Algorithms – ESA 2005
• Faster maximal clique enumeration in large real-world link streams
• A note on the problem of reporting maximal cliques
• Theoretical underpinnings for maximal clique enumeration on perturbed graphs

This page was built for publication: Enumerating maximal cliques in large sparse graphs

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