✦ LIBER ✦

Computing a minimum outer-connected dominating set for the class of chordal graphs

✍ Scribed by Mark Keil, J.; Pradhan, D.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the minimum outer-c

✍ Pradhan, D. 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 288 KB

The NP-completeness of steiner tree and

✍ Haiko Müller; Andreas Brandstädt 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 838 KB

A self-stabilizing 6-approximation for t

✍ Sayaka Kamei; Hirotsugu Kakugawa 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 242 KB

A greedy algorithm for the minimum\(2\)-

✍ Shi, Yishuo; Zhang, Yaping; Zhang, Zhao; Wu, Weili 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 441 KB

Boundary classes of graphs for the domin

✍ Vladimir E Alekseev; Dmitry V Korobitsyn; Vadim V Lozin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 210 KB

A linear time algorithm for computing a

✍ Panda, B.S.; Pradhan, D. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 370 KB