Pages that link to "Item:Q1751145"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145):

Displaying 22 items.

PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732) (← links)
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} (Q2091118) (← links)
Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
Kernels for packing and covering problems (Q2272393) (← links)
Algorithm for online 3-path vertex cover (Q2300630) (← links)
Parameterized algorithm for 3-path vertex cover (Q2317858) (← links)
An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (Q2659056) (← links)
On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
Faster parameterized algorithms for two vertex deletion problems (Q2699960) (← links)
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
(Q5225203) (← links)
A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)