90 search results - page 10 / 18 » Finding the Most Vital Node of a Shortest Path |
ANSS
2006
IEEE
14 years 1 months ago
2006
IEEE
There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider findi...
CN
2002
13 years 7 months ago
2002
Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the exist...
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...
ICCI
1991
13 years 11 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
Security is a critical issue in a mobile ad hoc network (MANET). In most of the previous protocols security is an added layer above the routing protocol. We propose a TrustAware R...