On comparing algorithms for the maximum clique problem.
Alexandre Prusch ZügeRenato CarmoPublished in: Discret. Appl. Math. (2018)
Keyphrases
- orders of magnitude
- data structure
- convergence rate
- learning algorithm
- benchmark datasets
- optimization problems
- computationally efficient
- maximum clique
- neural network
- benchmark problems
- computationally expensive
- computational efficiency
- machine learning algorithms
- theoretical analysis
- itemsets
- computational cost
- significant improvement
- lower bound
- website
- social networks
- genetic algorithm
- information retrieval
- real world