Pages that link to "Item:Q1944208"
From MaRDI portal
The following pages link to A kernel of order \(2k-c\log k\) for vertex cover (Q1944208):
Displaying 14 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- A kernel of order \(2k - c\) for Vertex Cover (Q534063) (← links)
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition (Q1643162) (← links)
- Crown structures for vertex cover kernelization (Q2464323) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- Parameterized Power Vertex Cover (Q3181050) (← links)
- (Q5009475) (← links)
- (Q5089163) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
- On kernels for \(d\)-path vertex cover (Q6564612) (← links)