Add to ORKGCaption title.Includes bibliographical references (leaves 15-16).Research supported by a Vinton Hayes fellowship
A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the to...
Abstract—In this paper, we investigate the fundamental prop-erties of broadcasting in mobile wireles...
Abstract A dominating set is a subset of the nodes of a graph such that all nodes are in the set or ...
We model a snapshot of a mobile packet radio network as an undirected graph. The nodes of the graph ...
Wireless ad hoc networks are advancing rapidly, both in research and more and more into our everyday...
International audienceIn this paper, we focus on the construction of an efficient dominating set in ...
Historically,The concept of domination in graphs found its origin in 1850s with the inter est of sev...
[[abstract]]A k-dominating set is a subset of nodes such that each node not in the set can be reache...
An essential component of effective use of Ad Hoc Wireless networks is proper utilization of availabl...
Abstract — Since there is no fixed infrastructure or centralized management in wireless ad hoc netwo...
AbstractWe consider a connected undirected graph G(n,m) with n nodes and m edges. A k-dominating set...
We present a series of approximation algorithms for finding a small weakly-connected dominating set ...
A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the to...
In this paper we study the problem of building a constant-degree connected dominating set (CCDS), a ...
We study broadcasting (one-to-all communication) in known topology radio networks modeled by graphs,...
A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the to...
Abstract—In this paper, we investigate the fundamental prop-erties of broadcasting in mobile wireles...
Abstract A dominating set is a subset of the nodes of a graph such that all nodes are in the set or ...
We model a snapshot of a mobile packet radio network as an undirected graph. The nodes of the graph ...
Wireless ad hoc networks are advancing rapidly, both in research and more and more into our everyday...
International audienceIn this paper, we focus on the construction of an efficient dominating set in ...
Historically,The concept of domination in graphs found its origin in 1850s with the inter est of sev...
[[abstract]]A k-dominating set is a subset of nodes such that each node not in the set can be reache...
An essential component of effective use of Ad Hoc Wireless networks is proper utilization of availabl...
Abstract — Since there is no fixed infrastructure or centralized management in wireless ad hoc netwo...
AbstractWe consider a connected undirected graph G(n,m) with n nodes and m edges. A k-dominating set...
We present a series of approximation algorithms for finding a small weakly-connected dominating set ...
A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the to...
In this paper we study the problem of building a constant-degree connected dominating set (CCDS), a ...
We study broadcasting (one-to-all communication) in known topology radio networks modeled by graphs,...
A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the to...
Abstract—In this paper, we investigate the fundamental prop-erties of broadcasting in mobile wireles...
Abstract A dominating set is a subset of the nodes of a graph such that all nodes are in the set or ...