How randomized search heuristics find maximum cliques in planar graphs.
Tobias StorchPublished in: GECCO (2006)
Keyphrases
- search heuristics
- planar graphs
- constraint programming
- evolutionary algorithm
- search strategy
- search algorithm
- tabu search
- weighted graph
- search strategies
- beam search
- knapsack problem
- minimum weight
- genetic algorithm
- search procedures
- learning algorithm
- graphical models
- constraint satisfaction problems
- search space
- graph structure