364 search results - page 73 / 73 » Shortest-path network interdiction |
83
Voted
SIGCOMM
1999
ACM
15 years 4 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
BMCBI
2008
14 years 11 months ago
2008
Background: Recent years have seen the development of various pathway-based methods for the analysis of microarray gene expression data. These approaches have the potential to bri...
138
Voted
COR
2008
14 years 11 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...
106
Voted
CICLING
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...