✦ LIBER ✦

Parameterized complexity of connected even/odd subgraph problems

✍ Scribed by Fomin, Fedor V.; Golovach, Petr A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight complexity bounds for FPT subgraph

✍ Broersma, Hajo; Golovach, Petr A.; Patel, Viresh 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Parameterized complexity of the induced

✍ Venkatesh Raman; Somnath Sikdar 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Parameterized complexity of generalized

✍ Petr A. Golovach; Jan Kratochvíl; Ondřej Suchý 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 376 KB

Parameterized complexity of constraint s

✍ Dániel Marx 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 285 KB

The Parameterized Complexity of Counting

✍ Flum, Jörg; Grohe, Martin 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 347 KB

Parameterized Complexity of Eulerian Del

✍ Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk… 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 694 KB