Pages that link to "Item:Q1643162"
From MaRDI portal
The following pages link to A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162):
Displaying 11 items.
- A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
- A kernel of order \(2k-c\log k\) for vertex cover (Q1944208) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Crown structures for vertex cover kernelization (Q2464323) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Parameterized and Exact Computation (Q5311519) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710807) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)