✦ LIBER ✦

New parameterized algorithms for the edge dominating set problem

✍ Scribed by Xiao, Mingyu; Kloks, Ton; Poon, Sheung-Hung

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

Linear Time Algorithms for Generalized E

✍ André Berger; Ojas Parekh 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 315 KB

Algorithms for minimum -connected -tuple

✍ Weiping Shang; Pengjun Wan; Frances Yao; Xiaodong Hu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 218 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

Experimental Analysis of Heuristic Algor

✍ L. A. Sanchis 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 108 KB