✦ LIBER ✦

Hardness results and approximation algorithm for total liar’s domination in graphs

✍ Scribed by B. S. Panda, S. Paul

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Liar’s domination in graphs: Complexity

✍ Panda, B.S.; Paul, S. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Hardness results and approximation algor

✍ Lei Chen; Changhong Lu; Zhenbing Zeng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 532 KB

A linear time algorithm for liarʼs domin

✍ Panda, B.S.; Paul, S. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Domination in graphs with bounded propag

✍ Ashkan Aazami 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 733 KB

An efficient algorithm for distance tota

✍ Zhao, Yancai; Shan, Erfang 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 227 KB

[Springer Monographs in Mathematics] Tot

✍ Henning, Michael A.; Yeo, Anders 📂 Article 📅 2013 🏛 Springer New York ⚖ 171 KB