✦ LIBER ✦

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number

✍ Scribed by Konrad Dabrowski; Vadim Lozin; Haiko Müller; Dieter Rautenbach

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spectral bounds for the clique and indep

✍ Herbert S Wilf 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Parameterized complexity of the maximum

✍ Vadim V. Lozin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Upper bound for the number of independen

✍ A. A. Sapozhenko 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 175 KB

The Complexity of Finding Paths in Graph

✍ Nickelsen, Arfst; Tantau, Till 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 289 KB

Analysis of the impact of the number of

✍ D. S. Malyshev 📂 Article 📅 2012 🏛 Pleiades Publishing 🌐 English ⚖ 473 KB

Extending the Balas-Yu bounds on the num

✍ Endre Boros; Khaled Elbassioni; Vladimir Gurvich; Leonid Khachiyan 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 191 KB