منابع مشابه
On the independent dominating set polytope
In this paper, we consider the independent dominating set polytope. We give a complete linear description of that polytope when the graph is reduced to a cycle. This description uses a general class of valid inequalities introduced in [T.M. Contenza, Some results on the dominating set polytope, Ph.D. Dissertation, University of Kentucky, 2000]. We devise a polynomial time separation algorithm f...
متن کاملOn the Dominating Set Polytope of a Cycle
A subset of vertices of a graph is called a dominating set if every vertex of the graph which is not present in the set has at least one neighbour in it. Dominating set polytope of a graph is defined as the convex hull of 0/1-incidence vectors of all the dominating sets of the graph. This paper presents complete characterization of the dominating set polytope of a cycle.
متن کاملOn Approximability of the Independent/Connected Edge Dominating Set Problems
We investigate polynomial-time approximability of the problems related to edge dominating sets of graphs. When edges are unit-weighted, the edge dominating set problem is polynomially equivalent to the minimum maximal matching problem, in either exact or approximate computation, and the former problem was recently found to be approximable within a factor of 2 even with arbitrary weights. It wil...
متن کاملAn independent dominating set in the complement of a minimum dominating set of a tree
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.
متن کاملFast Algorithms for min independent dominating set
We first devise a branching algorithm that computes a minimum independent dominating set with running time O∗(1.3351n) = O∗(20.417n) and polynomial space. This improves upon the best state of the art algorithms for this problem. We then study approximation of the problem by moderately exponential time algorithms and show that it can be approximated within ratio 1 + ε, for any ε > 0, in a time s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2006
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2004.07.015