Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver.

Matthias F. Stallmann Yang Ho Timothy D. Goodrich

Published in: CoRR (2020)

Keyphrases

vertex cover
planar graphs
approximation algorithms
random walk
graph structure
bipartite graph
undirected graph
weighted graph
graph theory
bayesian networks
partial order
connected components
theoretical analysis
precedence constraints
data points
optimality criterion
pairwise