Pages that link to "Item:Q2988857"

The following pages link to Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857):

Displaying 24 items.

• Kernelization of the 3-path vertex cover problem (Q279214) (← links)
• Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
• A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
• A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• Complexity of the maximum \(k\)-path vertex cover problem (Q1641128) (← links)
• Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← 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)
• A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← 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)
• On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
• An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover} (Q2659056) (← links)
• Faster parameterized algorithms for two vertex deletion problems (Q2699960) (← links)
• (Q5009486) (← links)
• (Q5092393) (← links)
• (Q5225203) (← links)
• Parameterized and Exact Computation (Q5311523) (← links)
• A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)
• Kernelization for edge triangle packing and covering via a discharging method (Q6558639) (← links)
• On kernels for \(d\)-path vertex cover (Q6564612) (← links)
• A discharging method: improved kernels for edge triangle packing and covering (Q6591629) (← links)