Report copyright - Kernelization and Complexity Results for Connectivity ... · NP-completeness of both problems if E′ is incomplete. Motivated by the NP-completeness, the polynomial-time approximability
Please pass captcha verification before submit form