𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear algorithm for finding a minimum dominating set in a cactus

✍ Scribed by S.T Hedetniemi; Renu Laskar; John Pfaff

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
312 KB
Volume
13
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An independent dominating set in the com
An independent dominating set in the complement of a minimum dominating set of a tree
✍ Michael A. Henning; Christian LΓΆwenstein; Dieter Rautenbach πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 267 KB

We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T , there is an independent dominating set I of T which is disjoint from D. This confirms a recent conjecture of Johnson, Prier, and Walsh.

A self-stabilizing algorithm for finding
A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
✍ Tetz C. Huang; Ji-Cherng Lin; Chih-Yuan Chen; Cheng-Pin Wang πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 202 KB

A 2-dominating set in a distributed system is a set of processors such that each processor outside the set has at least two neighbors in the set. In applications, a 2-dominating set can be considered as an ideal place in the system for allocating resources, and a minimal 2-dominating set allows for

Distributed algorithms for finding the u
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars
✍ Fu-Hsing Wang; Jou-Ming Chang; Yue-Li Wang; Sun-Jen Huang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 191 KB

A distance-k dominating set D of a directed graph G is a set of vertices such that for every vertex v of G; there is a vertex uAD and the distance between u and v is at most k: Minimum distance-k dominating set is especially important in communication networks for distributed data structures and for