Login / Signup
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities.
Eric Angel
Romain Campigotto
Christian Laforest
Published in:
Algorithmic Oper. Res. (2011)
Keyphrases
</>
vertex cover
low memory
planar graphs
graph theory
theoretical analysis
approximation algorithms
learning algorithm
probabilistic model
combinatorial optimization
graph structure