707 search results - page 22 / 142 » Solving path problems on the GPU |
121
click to vote
STACS
1994
Springer
15 years 3 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
Recent techniques for inferring business relationships between ASs [3, 8] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao [9]. However, some ...
RANDOM
1998
Springer
15 years 4 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
104
click to vote
PVLDB
2010
14 years 10 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
103
click to vote
STAIRS
2008
15 years 1 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...