Sciweavers

3678 search results - page 45 / 736
» On the Stable Paths Problem
Sort
View
PC
2010
196views Management» more  PC 2010»
13 years 8 months ago
Solving path problems on the GPU
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...
Aydin Buluç, John R. Gilbert, Ceren Budak
BIRTHDAY
2009
Springer
14 years 4 months ago
Properly Coloured Cycles and Paths: Results and Open Problems
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...
Gregory Gutin, Eun Jung Kim
IEEEPACT
2006
IEEE
14 years 4 months ago
Program generation for the all-pairs shortest path problem
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...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
IPPS
1998
IEEE
14 years 2 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
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....
Sven Venema, Hong Shen, Francis Suraweera
TEC
2002
117views more  TEC 2002»
13 years 9 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
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 ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna