Pages that link to "Item:Q833573"
From MaRDI portal
The following pages link to An edge-reduction algorithm for the vertex cover problem (Q833573):
Displaying 8 items.
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- Solving NP-hard problems in 'almost trees': vertex cover (Q1062757) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- Approximation Algorithms for Edge-Covering Problem (Q3628568) (← links)
- (Q3715136) (← links)
- A heuristic approach to the vertex cover problem (Q3976603) (← links)
- Experimental and Efficient Algorithms (Q5710054) (← links)