Pages that link to "Item:Q2258357"
From MaRDI portal
The following pages link to An approximation of the minimum vertex cover in a graph (Q2258357):
Displaying 10 items.
- On approximating minimum vertex cover for graphs with perfect matching (Q557830) (← links)
- Connected vertex covers in dense graphs (Q974753) (← links)
- Minimal cut cover of a graph with an application to the testing of electronic boards (Q1195870) (← links)
- Approximating the minimum tour cover of a digraph (Q1736480) (← links)
- Approximating the dense set-cover problem (Q1765297) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
- (Q3641922) (← links)
- Approximation of Self-stabilizing Vertex Cover Less Than 2 (Q5307040) (← links)
- Algorithms - ESA 2003 (Q5897254) (← links)
- Approximating the minimum hub cover problem on planar graphs (Q5963689) (← links)