Decomposing clique search problems into smaller instances based on node and edge colorings.
Sándor SzabóBogdán ZaválnijPublished in: Discret. Appl. Math. (2018)
Keyphrases
- search problems
- solving hard
- search algorithm
- orders of magnitude
- random instances
- systematic search algorithms
- heuristic search
- undirected graph
- search strategies
- combinatorial problems
- search space
- constraint satisfaction problems
- heuristic search algorithms
- graph coloring
- parallel version
- stochastic local search
- iterative deepening
- genetic algorithm
- edge weights
- satisfiability problem
- planning problems
- weighted graph
- propositional satisfiability
- constraint satisfaction
- computational complexity
- shortest path