✦ LIBER ✦

On the complexity of the minimum outer-connected dominating set problem in graphs

✍ Scribed by Pradhan, D.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing a minimum outer-connected domi

✍ Mark Keil, J.; Pradhan, D. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Formulations for the Minimum 2-Connected

✍ do Forte, Vinicius Leal; Lucena, Abilio; Maculan, Nelson 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Algorithms for the minimum weightk-fold

✍ Wenkai Ma; Deying Li; Zhao Zhang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 492 KB

On the outer-connected domination in gra

✍ Akhbari, M. H.; Hasni, R.; Favaron, O.; Karami, H.; Sheikholeslami, S. M. 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 368 KB

A note on the complexity of minimum domi

✍ Fabrizio Grandoni 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 92 KB

The Minimum Weight Dominating Set Proble

✍ C. Rhee; S.K. Dhall; S. Lakshmivarahan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 334 KB