✦ LIBER ✦

The weighted perfect domination problem and its variants

✍ Scribed by Yen Chain-Chin; R.C.T. Lee

Book ID: 104183090
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 867 KB
Volume: 66
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00138-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The weighted perfect domination problem

✍ Chain-Chin Yen; R.C.T. Lee 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 393 KB

A linear time algorithm to solve the wei

A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs

✍ Chain-Chin Yen; R.C.T. Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 379 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

ROMAN DOMINATION AND ITS VARIANTS IN UNI

ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS

✍ SHANG, WEIPING; WANG, XIUMEI; HU, XIAODONG 📂 Article 📅 2010 🏛 World Scientific 🌐 English ⚖ 147 KB

Solving the weighted efficient edge domi

Solving the weighted efficient edge domination problem on bipartite permutation graphs

✍ Chin Lung Lu; Chuan Yi Tang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Given a simple graph G = (V, E), an edge (u, u) E E is said to dominate itself and any edge (u,x) or (u,x), where x E V. A subset D C E is called an efficient edge dominating set of G if all edges in E are dominated by exactly one edge of D. The efficient edge domination problem is to find an effici

The weighted independent domination prob

The weighted independent domination problem is NP-complete for chordal graphs

✍ Gerard J. Chang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 157 KB