149 search results - page 8 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
COR
2008
13 years 7 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
JCIT
2008
13 years 7 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
In this paper, a new genetic mating scheme called Controlled Content Crossover (CCC) is proposed and applied to solve the optical network component allocation problem. In order to ...
OOPSLA
1999
Springer
13 years 11 months ago
1999
Springer
Java programs are routinely transmitted over low-bandwidth network connections as compressed class le archives (i.e., zip les and jar les). Since archive size is directly proporti...