Add to ORKGA distance-k dominating set S of a di-rected graph D is a set of vertices such that for every vertex v of D, there is a vertex u ∈ S at distance at most k from it. Minimum distance-k dominating set is especially important in communication networks for distributed data structure and for server placement. In this paper, we shall present simple distributed algorithms for finding the unique minimum distance-k dominating set for k = 1, 2 in a directed split-star, which has recently been devel-oped as a new model of the interconnection network for parallel and distributed com-puting systems.
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
AbstractLet k be a positive integer and G be a simple connected graph with order n. The average dist...
Abstract — Since there is no fixed infrastructure or centralized management in wireless ad hoc netwo...
AbstractThe distance- t dominating set is an interesting property used in the allocation of finite r...
AbstractWe consider a connected undirected graph G(n,m) with n nodes and m edges. A k-dominating set...
Abstract A dominating set is a subset of the nodes of a graph such that all nodes are in the set or ...
Let $G$ be a graph with vertex set $V$, and let $k$ be a positive integer. A set $D \subseteq V$ is ...
1 We consider the problem of finding a minimum connected dominating set (CDS) in unit disk graphs. A...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a ...
AbstractLet G=(V,E) be a graph without isolated vertices. For a positive integer k, a set S⊆V is a k...
In this paper, we study the problem of minimum con-nected dominating set in geometric k-disk graphs....
A subset D ⊆ V(G) is called a k-distance dominating set of G if every vertex in V(G)-D is within di...
AbstractFor any positive integer n and any graph G a set D of vertices of G is a distance-n dominati...
AbstractIn this paper, we study a generalization of the paired domination number. Let G=(V,E) be a g...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
AbstractLet k be a positive integer and G be a simple connected graph with order n. The average dist...
Abstract — Since there is no fixed infrastructure or centralized management in wireless ad hoc netwo...
AbstractThe distance- t dominating set is an interesting property used in the allocation of finite r...
AbstractWe consider a connected undirected graph G(n,m) with n nodes and m edges. A k-dominating set...
Abstract A dominating set is a subset of the nodes of a graph such that all nodes are in the set or ...
Let $G$ be a graph with vertex set $V$, and let $k$ be a positive integer. A set $D \subseteq V$ is ...
1 We consider the problem of finding a minimum connected dominating set (CDS) in unit disk graphs. A...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a ...
AbstractLet G=(V,E) be a graph without isolated vertices. For a positive integer k, a set S⊆V is a k...
In this paper, we study the problem of minimum con-nected dominating set in geometric k-disk graphs....
A subset D ⊆ V(G) is called a k-distance dominating set of G if every vertex in V(G)-D is within di...
AbstractFor any positive integer n and any graph G a set D of vertices of G is a distance-n dominati...
AbstractIn this paper, we study a generalization of the paired domination number. Let G=(V,E) be a g...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorith...
AbstractLet k be a positive integer and G be a simple connected graph with order n. The average dist...
Abstract — Since there is no fixed infrastructure or centralized management in wireless ad hoc netwo...