Hard Graphs for the Randomized Boppana-Halldörsson Algorithm for MAXCLIQUE.
Marcus PeinadoPublished in: Nord. J. Comput. (1994)
Keyphrases
- detection algorithm
- graph structure
- learning algorithm
- optimal solution
- experimental evaluation
- objective function
- undirected graph
- times faster
- dynamic programming
- maximum clique
- computational complexity
- np hard
- cost function
- significant improvement
- worst case
- random graphs
- particle swarm optimization
- search space
- randomized algorithms
- graph clustering
- graph isomorphism
- minimum spanning tree
- graph partitioning
- convergence rate
- high accuracy
- upper bound
- k means
- preprocessing