Pages that link to "Item:Q657921"
From MaRDI portal
The following pages link to A generalization of Nemhauser and Trotter's local optimization theorem (Q657921):
Displayed 13 items.
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- Kernelization of the 3-path vertex cover problem (Q279214) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs (Q2931950) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion (Q3196407) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)