Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms.
Alessio ConteEtsuji TomitaPublished in: WALCOM (2021)
Keyphrases
- computational complexity
- worst case
- computational cost
- significant improvement
- lower complexity
- benchmark datasets
- data structure
- recently developed
- decision problems
- computationally efficient
- theoretical analysis
- learning algorithm
- reduced complexity
- computationally complex
- maximum clique
- high computational complexity
- complexity analysis
- space complexity
- memory requirements
- combinatorial optimization
- times faster
- computationally expensive
- computational efficiency
- optimization problems
- markov random field