Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization.
Wanru GaoTobias FriedrichTimo KötzingFrank NeumannPublished in: Australasian Conference on Artificial Intelligence (2017)
Keyphrases
- satisfiability testing
- parallel processing
- search algorithm
- global search
- genetic algorithm
- memetic algorithm
- simulated annealing
- graph matching
- parallel implementation
- search space
- graph representation
- graph theoretic
- neighborhood search
- graph search
- graph model
- shared memory
- evolutionary algorithm
- neural network
- tabu search
- parallel computation
- instance selection
- graph data
- job shop scheduling problem
- parallel computing
- search strategies
- directed graph
- combinatorial optimization
- parallel algorithm