✦ LIBER ✦

Liar’s domination in graphs: Complexity and algorithm

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hardness results and approximation algor

✍ B. S. Panda, S. Paul 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 684 KB

A linear time algorithm for liarʼs domin

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

The algorithmic complexity of minus domi

✍ Jean Dunbar; Wayne Goddard; Stephen Hedetniemi; Alice McRae; Michael A. Henning 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 796 KB

The complexity of domination problems in

✍ J.Mark Keil 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 854 KB

Complexity of distance paired-domination

✍ Chang, Gerard J.; Panda, B.S.; Pradhan, D. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Improved Algorithms and Complexity Resul

✍ Jiong Guo; Rolf Niedermeier; Daniel Raible 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 495 KB