410 search results - page 25 / 82 » Upgrading Shortest Paths in Networks |
136
click to vote
KDD
2004
ACM
15 years 6 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
115
click to vote
NETWORKS
2007
15 years 28 days ago
2007
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
104
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
101
click to vote
AAIM
2008
Springer
15 years 7 months ago
2008
Springer
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total trans...
100
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...