Courses/Parameterized Algorithms/
06. Kernelization: Nemhauser-Trotter and Expansion Lemma

06. Kernelization: Nemhauser-Trotter and Expansion Lemma

Week
Week 01
Description
Use LP based Nemhauser-Trotter to get vertex kernel for Veretx Cover, Also introduce Expansion Lemma to get kernel for Component Order Connectivity.
Problems
Module