✦ LIBER ✦

Fast algorithms for the dominating set problem on permutation graphs

✍ Scribed by Kuo-Hui Tsai; Wen-Lian Hsu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Minimum Weight Dominating Set Proble

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

On-line algorithms for the dominating se

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

Sequential and parallel algorithms for t

✍ Ming-Shing Yu; Lin Yu Tseng; Shoe-Jane Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A new approach for the domination proble

✍ Y. Liang; C. Rhee; S.K. Dhall; S. Lakshmivarahan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 933 KB

On the feedback vertex set problem in pe

✍ Y. Daniel Liang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Fixed Parameter Algorithms for DOMINATIN

✍ Alber; Bodlaender; Fernau; Kloks; Niedermeier 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 310 KB