Pages that link to "Item:Q903365"
From MaRDI portal
The following pages link to A faster FPT algorithm for 3-path vertex cover (Q903365):
Displaying 4 items.
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- Generating Faster Algorithms for d-Path Vertex Cover (Q6496548) (← links)
