Pages that link to "Item:Q991748"

The following pages link to An improved kernelization for \(P_{2}\)-packing (Q991748):

Displaying 14 items.

• An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
• Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
• A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
• On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
• A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
• Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
• Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps (Q2828236) (← links)
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
• Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
• (Q5743378) (← links)
• A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)