Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities
From MaRDI portal
Publication:2865867
Recommendations
- Analytical and experimental comparison of six algorithms for the vertex cover problem
- Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess
- A warning propagation-based linear-time-and-space algorithm for the minimum vertex cover problem on giant graphs
- New approximation algorithms for the vertex cover problem
- scientific article; zbMATH DE number 1508265
Cited in
(8)- Refined memorization for vertex cover
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
- Statistical mechanics of the vertex-cover problem
- Parameterized and Exact Computation
- Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess
- A warning propagation-based linear-time-and-space algorithm for the minimum vertex cover problem on giant graphs
- Analytical and experimental comparison of six algorithms for the vertex cover problem
- Solving vertex cover in polynomial time on hyperbolic random graphs
This page was built for publication: Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865867)
