✦ LIBER ✦

On approximating the minimum independent dominating set

✍ Scribed by Robert W. Irving

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 550 KB
Volume: 37
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90188-n

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.

Finding a minimum independent dominating

Finding a minimum independent dominating set in a permutation graph

✍ Mikhail J. Atallah; Glenn K. Manacher; J. Urrutia 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 862 KB

Minimum Dominating Sets of Intervals on

Minimum Dominating Sets of Intervals on Lines

✍ S. -W. Cheng; M. Kaminski; S. Zaks 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 169 KB

Approximating the minimum maximal indepe

Approximating the minimum maximal independence number

✍ Magnús M. Halldórsson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 289 KB

On minimum intersection of two minimum d

On minimum intersection of two minimum dominating sets of interval graphs

✍ Chang Maw-Shang; Hsu Chung-Chang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 748 KB

This paper gives linear-time algorithms for finding two minimum (connected) dominating sets with minimum intersection for interval graphs.

On minimum maximal independent sets of a

On minimum maximal independent sets of a graph

✍ Julie Haviland 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 638 KB