149 search results - page 13 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
EUC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
BMCBI
2010
13 years 7 months ago
2010
Background: The development of high-throughput laboratory techniques created a demand for computer-assisted result analysis tools. Many of these techniques return lists of genes w...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...