390 search results - page 42 / 78 » Computing shortest paths for any number of hops |
121
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
303
click to vote
COCOON
2011
Springer
14 years 1 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
95
Voted
SDM
2008
SIAM
15 years 3 months ago
2008
SIAM
Recently, modern tracking methods started to allow capturing the position of massive numbers of moving objects. Given this information, it is possible to analyze and predict the t...
98
Voted
COMCOM
2004
15 years 1 months ago
2004
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
103
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...