Any algorithm can be made to take advantage of connected components. Just find the connected components before running the algorithm, discard those smaller than k
and run the algorithm separately on each of the remaining ones.
K-Clique in Connected Graphs
-
07-12-2021 - |
Question
A question about the clique problem (specifically k-clique). Is there any algorithm that takes advantage of the properties of connected graphs to find cliques of a given size k
, if such cliques exist?
Solution
Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow