Pages that link to "Item:Q849135"
From MaRDI portal
The following pages link to A parameterized perspective on packing paths of length two (Q849135):
Displayed 16 items.
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- Combinatorial search in two and more rounds (Q2420609) (← links)
- Packing paths: recycling saves time (Q2446295) (← links)
- Local improvement algorithms for a path packing problem: a performance analysis based on linear programming (Q2661591) (← links)
- Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps (Q2828236) (← links)
- Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- (Q5743378) (← links)
- A \(5k\)-vertex kernel for 3-path vertex cover (Q6041673) (← links)