Results 1  10
of
194
Finding the Hidden Path: Time Bounds for AllPairs Shortest Paths
, 1993
"... We investigate the allpairs shortest paths problem in weighted graphs. We present an algorithmthe Hidden Paths Algorithmthat finds these paths in time O(m* n+n² log n), where m is the number of edges participating in shortest paths. Our algorithm is a practical substitute for Dijkstra&ap ..."
Abstract

Cited by 75 (0 self)
 Add to MetaCart
We investigate the allpairs shortest paths problem in weighted graphs. We present an algorithmthe Hidden Paths Algorithmthat finds these paths in time O(m* n+n² log n), where m is the number of edges participating in shortest paths. Our algorithm is a practical substitute for Dijkstra
A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations
 IEEE Transactions on Evolutionary Computation
"... Abstract—This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variablelength chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation exchanges partial chromosomes (partial routes) at positionally in ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
Abstract—This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variablelength chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation exchanges partial chromosomes (partial routes) at positionally
Crossover can provably be useful in evolutionary computation
 Genetic and Evolutionary Computation Conference 2008, Atlanta, USA, 2008, Proceedings of the 10th annual conference on Genetic and evolutionary computation
"... We show that the natural evolutionary algorithm for the allpairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoretical analysis proving the usefulness of crossover for a nonartificial problem. 1 ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
We show that the natural evolutionary algorithm for the allpairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoretical analysis proving the usefulness of crossover for a nonartificial problem. 1
Efficiency Evaluation of Shortest Path Algorithms
"... Abstract—While the ever growing computational capabilities of devices that are used for manmachine interaction are taken for granted, the need to find their most optimum use is as important as ever. This issue is particularly relevant when considering solutions where the determination of the shorte ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of the shortest path between given points (nodes) is one of the basic operations. In more complex executions of the shortest paths, sets of paths with the shortest distance between a single initial (source) point and all other destination points, as well as between all pairs of points, are to be found. For each
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 allpairs shortestpaths, transitive closure, and LU decomposition without pivoting) having similar data access patterns ..."
Abstract
 Add to MetaCart
patterns. Using the allpairs shortestpaths problem as an example, we uncover potential gains over this class of algorithms. The impressive computational power and memory bandwidth of the GPU make it an attractive platform to run such computationally intensive algorithms. Although improvements over CPU
Partially dynamic algorithms for distributed shortest paths and their experimental evaluation
 Journal of Computers
"... Abstract — In this paper, we study the dynamic version of the distributed allpairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work under the assumption that before dealing with an edge operation, the algorithm for the previous operation has to ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract — In this paper, we study the dynamic version of the distributed allpairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work under the assumption that before dealing with an edge operation, the algorithm for the previous operation has
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation
, 2007
"... Abstract — In this paper, we study the dynamic version of the distributed allpairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work under the assumption that before dealing with an edge operation, the algorithm for the previous operation has to ..."
Abstract
 Add to MetaCart
Abstract — In this paper, we study the dynamic version of the distributed allpairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work under the assumption that before dealing with an edge operation, the algorithm for the previous operation has
Solving Shortest Paths Efficiently on Nearly Acyclic Directed Graphs
"... Shortest path problems can be solved very efficiently when a directed graph is nearly acyclic. Earlier results defined a graph decomposition, now called the 1dominator set, which consists of a unique collection of acyclic structures with each single acyclic structure dominated by a single associate ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
by defining acyclic structures in both directions over edges in the graph. The bidirectional 1dominator set can similarly be computed in O(m) time and included as part of the O(m + r log r) time spent computing singlesource. This paper also presents a new allpairs algorithm under the more general
Review and Performance Analysis of Shortest Path Problem Solving Algorithms
"... Abstract—The development of concepts derived from the generic approach to solving the problem of the shortest path resulted in numerous and various algorithms that appeared over the past decades. The studies on the most basic operation aimed at the determination of the shortest path between two give ..."
Abstract
 Add to MetaCart
given points in a graph (in other words, often a network) have resulted in sophisticated solutions designed for more and more demanding applications. Those include finding the sets of paths with the shortest distance between all pairs of nodes or searching for a shortest path tree. The aim
Results 1  10
of
194