149 search results - page 3 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
ISCC
2005
IEEE
15 years 5 months ago
2005
IEEE
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
90
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
112
Voted
EDBT
2012
ACM
13 years 2 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
117
Voted
OL
2010
14 years 6 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
ICCCN
2008
IEEE
15 years 6 months ago
2008
IEEE
—The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues t...