2013 · 59 citations · 20 references
Natural SciencesComputer ScienceAlgorithmsCombinatoricsCombinatorial EnumerationCombinatorial OptimizationEnumerative CombinatoricsGraph AlgorithmsClique AlgorithmsCliquesComputational EfficiencyComputational Efficiency AnalysisEnumeration Algorithms For GraphsEnumerative AlgorithmsGraph EnumerationSearch Space Pruning
Recent research efforts have made notable progress in improving the performance of (exhaustive) maximal clique enumeration (MCE). However, existing algorithms still suffer from exploring the huge search space of MCE. Furthermore, their results are often undesirable as many of the returned maximal cliques have large overlapping parts. This redundancy leads to problems in both computational efficiency and usefulness of MCE.
20
Algorithm 457: finding all cliques of an undirected graph
Coen Bron, Joep Kerbosch · Communications of the ACM · 1973 · 2.5K citations · Full text
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverson et al. · 2009 · 1K citations
J. W. Moon, Leo Moser · Israel Journal of Mathematics · 1965 · 854 citations