390 search results - page 19 / 78 » Computing shortest paths for any number of hops |
126
Voted
JCM
2007
15 years 1 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
107
click to vote
GD
2009
Springer
15 years 6 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
102
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...
128
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
138
Voted
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Without the multicast support from the underlying networks, overlay multicast has the advantage of implementing inter-domain multicast communications. Usually, overlay multicas...