Pages that link to "Item:Q4588848"
From MaRDI portal
The following pages link to Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848):
Displaying 11 items.
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
- An Efficient Local Search for the Minimum Independent Dominating Set Problem (Q5140723) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Algorithms - ESA 2003 (Q5897254) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
- Minimal zero forcing sets (Q6644905) (← links)
