✦ LIBER ✦

The multiple domination and limited packing problems in graphs

✍ Scribed by M.P. Dobson; V. Leoni; G. Nasini

Book ID: 113663246
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 210 KB
Volume: 111
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.09.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Limited Packing and Multiple Domination

Limited Packing and Multiple Domination problems: Polynomial time reductions

✍ Leoni, V.; Nasini, G. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 390 KB

The packing coloring problem for lobster

The packing coloring problem for lobsters and partner limited graphs

✍ Argiroffo, G.; Nasini, G.; Torres, P. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 407 KB

The complexity of domination problems in

The complexity of domination problems in circle graphs

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

Parallel algorithms for the domination p

Parallel algorithms for the domination problems in trapezoid graphs

✍ Y.Daniel Liang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination and domination problems in weighted trapezoid graphs. All these algorithms take O(log'n) time on a EREW PR

On the mixed domination problem in graph

On the mixed domination problem in graphs

✍ Lan, James K.; Chang, Gerard Jennhwa 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 437 KB

Polynomial algorithms for the weighted p

Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs

✍ Maw-Shang Chang; Yi-Chang Liu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 475 KB