✦ LIBER ✦

Parameterized computational complexity of finding small-diameter subgraphs

✍ Scribed by Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized complexity of finding smal

✍ Omid Amini; Ignasi Sau; Saket Saurabh 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 362 KB

Parameterized computational complexity o

✍ Nadja Betzler; Jiong Guo; Rolf Niedermeier 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 212 KB

A note on the complexity of finding regu

✍ J. Plesník 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Parameterized complexity of connected ev

✍ Fomin, Fedor V.; Golovach, Petr A. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 923 KB

An algorithm for finding all maximal com

✍ S.R. Das; C.L. Sheng; Z. Chen 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 322 KB

On the Parameterized Complexity of Findi

✍ Heggernes, Pinar; van ’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yn 📂 Article 📅 2014 🏛 Springer 🌐 English ⚖ 915 KB