✦ LIBER ✦

Parameterized complexity of the induced subgraph problem in directed graphs

✍ Scribed by Venkatesh Raman; Somnath Sikdar

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized complexity of the weighted

✍ Konrad Dabrowski; Vadim Lozin; Haiko Müller; Dieter Rautenbach 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 176 KB

On the parameterized complexity of color

✍ Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 182 KB

On the complexity of path problems in pr

✍ Donatella Granata, Behnam Behdani, Panos M. Pardalos 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 445 KB

Logic vs. complexity theoretic propertie

✍ Christoph Meinel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 344 KB

The complexity of domination problems in

✍ J.Mark Keil 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 854 KB

On the complexity of the multicut proble

✍ Cédric Bentz 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 232 KB