Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
نویسندگان
چکیده
A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. This paper presents e-cient algorithms for solving the weighted connected k-domination and the weighted k-dominating clique problems in distance-hereditary graphs. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs
Distance-hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distance-hereditary graphs from an algorithmic viewpoint. In particular, we present linear-time algorithms for finding a minimum weighted connected dominating set and a minimum vertex-weighted Steiner tree in a distance-hereditary graph...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کامل. Efficient Parallel Algorithms on Distance-Hereditary Graphs
In this papel; we present eficient parallel algorithms forjinding a minimum weighted connected dominating set, a minimum weighted Steiner tree for a distance-hereditary graph which take O(1og n) time using O(n+m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of a given graph, respectively. We also find a maximum weighted clique of a distance-hereditary graph in O...
متن کاملWeighted efficient domination problem on some perfect graphs
Given a simple graph G = (V; E), a vertex v ∈ V is said to dominate itself and all vertices adjacent to it. A subset D of V is called an e cient dominating set of G if every vertex in V is dominated by exactly one vertex in D. The e cient domination problem is to 3nd an e cient dominating set of G with minimum cardinality. Suppose that each vertex v ∈ V is associated with a weight. Then, the we...
متن کاملParameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy
We show that the problem k-DOMINATING SET and its several variants including k-CONNECTED DOMINATING SET, k-INDEPENDENT DOMINATING SET, and k-DOMINATING CLIQUE, when parameterized by the solution size k, are W[1]-hard in either multiple-interval graphs or their complements or both. On the other hand, we show that these problems belong to W[1] when restricted to multipleinterval graphs and their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 263 شماره
صفحات -
تاریخ انتشار 2001