Pages that link to "Item:Q2931950"
From MaRDI portal
The following pages link to A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs (Q2931950):
Displaying 5 items.
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
