90 search results - page 17 / 18 » Finding the Most Vital Node of a Shortest Path |
EUC
2005
Springer
14 years 1 months ago
2005
Springer
Some sensor applications are interested in collecting data from multiple regions. For supporting such applications with multiple target regions, most conventional protocols are bas...
SIROCCO
2010
13 years 9 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
BMCBI
2005
13 years 7 months ago
2005
Abstract. Taxonomy provides one of the most powerful ways to navigate sequence data bases but currently, users are forced to formulate queries according to a single taxonomic class...
GRC
2008
IEEE
13 years 8 months ago
2008
IEEE
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
CN
2008
13 years 7 months ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...