Pages that link to "Item:Q2008557"
From MaRDI portal
The following pages link to Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557):
Displaying 4 items.
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
