✦ LIBER ✦

On complexity of Minimum Leaf Out-Branching problem

✍ Scribed by Peter Dankelmann; Gregory Gutin; Eun Jung Kim

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Computational Complexity of the M

✍ Mikhail Yu. Khachay 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 442 KB

Complexity of minimum corridor guarding

✍ Ning Xu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Computational complexity of the minimum

✍ M. Yu. Khachai 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 194 KB

Complexity results on the minimum width

✍ Kunihiko Hayashi; Sumio Masuda 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 960 KB

Complexity of the minimum-dummy-activiti

✍ M. S. Krishnamoorthy; N. Deo 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

On the computational complexity of the m

✍ Maciej M. Syslo 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 454 KB