Login / Signup
Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess.
Shaowei Cai
Jinkun Lin
Chuan Luo
Published in:
J. Artif. Intell. Res. (2017)
Keyphrases
</>
vertex cover
maximum clique
planar graphs
brute force search
approximation algorithms
partial order
genetic algorithm
search algorithm
search space
graph theory
graph structure
finding optimal
random walk
tabu search
combinatorial optimization
undirected graph