𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithmic aspects of the -domination problem in graphs

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

Book ID
120444872
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
475 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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
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

(F_{3})-domination problem of graphs
(F_{3})-domination problem of graphs
✍ Chan-Wei Chang, David Kuo, Sheng-Chyang Liaw… πŸ“‚ Article πŸ“… 2012 πŸ› Springer US 🌐 English βš– 339 KB