Molecular docking using shape descriptors
Journal of Computational Chemistry
Enumerating all connected maximal common subgraphs in two graphs
Theoretical Computer Science
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
An algorithm for reporting maximal c-cliques
Theoretical Computer Science
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science - Computing and combinatorics
Isolation concepts for clique enumeration: Comparison and computational experiments
Theoretical Computer Science
RunTest: assuring integrity of dataflow processing in cloud computing infrastructures
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Finding maximal cliques in massive networks by H*-graph
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Listing all maximal cliques in large sparse real-world graphs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Finding maximal cliques in massive networks
ACM Transactions on Database Systems (TODS)
Computing Gröbner bases of pure binomial ideals via submodules of Zn
Journal of Symbolic Computation
Assignment-minimum clique coverings
Journal of Experimental Algorithmics (JEA)
Fast algorithms for maximal clique enumeration with limited memory
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
All roads lead to Rome---New search methods for the optimal triangulation problem
International Journal of Approximate Reasoning
Redundancy-aware maximal cliques
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Maximal clique enumeration in finding near neighbourhoods
Transactions on Rough Sets XVI
Fast Circular Arc Segmentation Based on Approximate Circularity and Cuboid Graph
Journal of Mathematical Imaging and Vision
| Hi-index | 5.23 |
Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper of Bron-Kerbosh [C. Bron, J. Kerbosch, Algorithm 457: Finding all cliques of an undirected graph, Communication of ACM 16 (9) (1973) 575-577], and two papers recently published in TCS, namely that of Tomita et al. [Tomita, A. Tanaka, H. Takahashi, The worst-case time complexity for generating all maximal cliques and computational experiments, Theoretical Computer Science 363 (1) (2006) 28-42], and that of Koch [I. Koch, Fundamental study: Enumerating all connected maximal common subgraphs in two graphs, Theoretical Computer Science 250 (1-2) (2001) 1-30]. In particular, we show that the strategy of Tomita et al. is a simple modification of the Bron-Kerbosch algorithm, based on an (un-exploited) observation raised in Koch's paper.