✦ LIBER ✦

ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS

✍ Scribed by SHANG, WEIPING; WANG, XIUMEI; HU, XIAODONG

Book ID: 118747690
Publisher: World Scientific
Year: 2010
Tongue: English
Weight: 147 KB
Volume: 02
Category: Article
ISSN: 1793-8309
DOI: 10.1142/S1793830910000504

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Difference between -rainbow domination a

Difference between -rainbow domination and Roman domination in graphs

✍ Fujita, Shinya; Furuya, Michitaka 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Note on 2-rainbow domination and Roman d

Note on 2-rainbow domination and Roman domination in graphs

✍ Yunjian Wu; Huaming Xing 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 244 KB

A Roman dominating function of a graph G is a function f : V → {0, 1, 2} such that every vertex with 0 has a neighbor with 2. The minimum of f (V (G)) = v∈V f (v) over all such functions is called the Roman domination number γ R (G). A 2-rainbow dominating function of a graph G is a function g that

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computational Science – ICCS 2007 Volume 4489 || The Roman Domination Problem in Unit Disk Graphs

✍ Shi, Yong; van Albada, Geert Dick; Dongarra, Jack; Sloot, Peter M. A. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 385 KB

On Roman, Global and Restrained Dominati

On Roman, Global and Restrained Domination in Graphs

✍ V. Zverovich; A. Poghosyan 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 160 KB

A -approximation algorithm for minimum w

A -approximation algorithm for minimum weighted dominating set in unit disk graph

✍ Decheng Dai; Changyuan Yu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 919 KB

A better constant-factor approximation f

A better constant-factor approximation for weighted dominating set in unit disk graph

✍ Yaochun Huang; Xiaofeng Gao; Zhao Zhang; Weili Wu 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 417 KB

This paper presents a (10 + ε)-approximation algorithm to compute minimum-weight connected dominating set (MWCDS) in unit disk graph. MWCDS is to select a vertex subset with minimum weight for a given unit disk graph, such that each vertex of the graph is contained in this subset or has a neigh