✦ LIBER ✦

A method to determine a minimal dominating set of a graph

✍ Scribed by Nieminen, J.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a minimum independent dominating

✍ Mikhail J. Atallah; Glenn K. Manacher; J. Urrutia 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 862 KB

A method to determine a minimal set of p

✍ Keiichi Iwamura; Hideki Imai 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 927 KB

Finding a dominating set on bipartite gr

✍ Mathieu Liedloff 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 110 KB

A counterexample to the dominating set c

✍ Antoine Deza; Gabriel Indik 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 111 KB

The identification of a minimal feedback

✍ Smith, G.; Walford, R. 📂 Article 📅 1975 🏛 IEEE ⚖ 862 KB

A -approximation algorithm for minimum w

✍ Decheng Dai; Changyuan Yu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 919 KB