✦ LIBER ✦

A decidability result for the dominating set problem

✍ Scribed by Vadim V. Lozin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line algorithms for the dominating se

✍ Gow-Hsing King; Wen-Guey Tzeng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Boundary classes of graphs for the domin

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

Algorithms for minimum -connected -tuple

✍ Weiping Shang; Pengjun Wan; Frances Yao; Xiaodong Hu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 218 KB

A distributed approximation algorithm fo

✍ Anurag Verma, Sergiy Butenko 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 500 KB

Algorithms for the minimum weightk-fold

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

Fast algorithms for the dominating set p

✍ Kuo-Hui Tsai; Wen-Lian Hsu 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 616 KB