3678 search results - page 45 / 736 » On the Stable Paths Problem |
177
click to vote
PC
2010
15 years 4 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
109
click to vote
BIRTHDAY
2009
Springer
16 years 23 days ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
157
click to vote
IEEEPACT
2006
IEEE
16 years 9 hour ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
167
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
152
click to vote
TEC
2002
15 years 5 months ago
2002
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...