✦ LIBER ✦

On the algorithmic complexity of -tuple total domination

✍ Scribed by Lan, James K.; Chang, Gerard Jennhwa

Book ID: 122273600
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 482 KB
Volume: 174
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.04.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Algorithmic Complexity of Total D

On the Algorithmic Complexity of Total Domination

✍ Laskar, Renu; Pfaff, John; Hedetniemi, S. M.; Hedetniemi, S. T. 📂 Article 📅 1984 🏛 Society for Industrial and Applied Mathematics ⚖ 629 KB

On the algorithmic complexity of edge to

On the algorithmic complexity of edge total domination

✍ Zhao, Yancai; Liao, Zuhua; Miao, Lianying 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 345 KB

Algorithmic aspects of k-tuple total dom

Algorithmic aspects of k-tuple total domination in graphs

✍ D. Pradhan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 228 KB

The algorithmic complexity of minus domi

The algorithmic complexity of minus domination in graphs

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

[Springer Monographs in Mathematics] Tot

[Springer Monographs in Mathematics] Total Domination in Graphs || Complexity and Algorithmic Results

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

On the computational complexity of upper

On the computational complexity of upper total domination

✍ Qizhi Fang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Let G = (V; E) be an undirected graph. Upper total domination number t (G) is the maximum cardinality over all minimal total dominating sets of G, and upper fractional total domination number t (G) is the maximum weight over all minimal total dominating functions of G. In this paper we show that: (1