Results 261 to 270 of about 190,109 (292)
Some of the next articles are maybe not open access.
Finding the k Shortest Paths for Co-Evolutionary Path Optimization
2018 IEEE Symposium Series on Computational Intelligence (SSCI), 2018Co-evolutionary path optimization (CEPO) was recently proposed to calculate optimal actual traveling trajectory in a given dynamic routing environment, and it was originally focused on the 1st shortest path. This paper, by taking advantage of a relatively new nature-inspired method, i.e., ripple-spreading algorithm (RSA), attempts to develop an ...
Xiao-Bing Hu +4 more
openaire +1 more source
An Efficient K-Shortest Paths Based Routing Algorithm
Advanced Materials Research, 2012We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm.
Jian Lian, Yan Zhang, Cheng Jiang Li
openaire +1 more source
A restoration mechanism using K-shortest control paths
Proceedings. Ninth IEEE International Conference on Networks, ICON 2001., 2005This paper presents a restoration scheme using k-shortest control paths. Our mechanism classified connections into two classes: real time class and non-real time class. In real time class, an ATM protection switching (APS) mechanism, a preventive restoration method defined in 1.630, is used as a restoration scheme that is realizing fast restoration and
null Dong-Yong Kwak +2 more
openaire +1 more source
Dynamic K-Shortest Path (DKSP) facility restoration algorithm
1994 IEEE GLOBECOM. Communications: The Global Bridge, 2002This paper describes the dynamic K-shortest path (DKSP) algorithm for distributed facility restoration and its performance in a simulation of AT&T's high-capacity digital facilities network. The guiding paradigm of this algorithm is that of a switched network.
M.T. Busche, C.M. Lockhart, C. Olszewski
openaire +1 more source
An efficient algorithm for K shortest simple paths
Networks, 1982AbstractThis article gives an efficient algorithm for obtaining K shortest simple paths between two specified nodes in an undirected graph G with non‐negative edge lengths. Letting n be the number of nodes and m be the number of edges in G, its running time is O(Kc(n, m)) if the shortest paths from one node to all the other nodes are obtained in c(n, m)
Katoh, N., Ibaraki, T., Mine, H.
openaire +1 more source
2015
Copyright © 2015 by the Society for Industrial and Applied Mathmatics.We consider the problem of computing k shortest paths in a two-dimensional environment with polygonal obstacles, where the jth path, for 1 ≤ j ≤ k, is the shortest path in the free space that is also homotopically distinct from each of the first j-1 paths. In fact, we consider a more
Eriksson-Bique, Sylvester +7 more
openaire +1 more source
Copyright © 2015 by the Society for Industrial and Applied Mathmatics.We consider the problem of computing k shortest paths in a two-dimensional environment with polygonal obstacles, where the jth path, for 1 ≤ j ≤ k, is the shortest path in the free space that is also homotopically distinct from each of the first j-1 paths. In fact, we consider a more
Eriksson-Bique, Sylvester +7 more
openaire +1 more source
On Mining Dynamic Graphs for k Shortest Paths
Mining graphs, upon query, for k shortest paths between vertex pairs is a prominent primitive to support several analytics tasks on complex networked datasets. The state-of-the-art method to implement this primitive is kPll, a framework that provides very fast query answering, even for large inputs and volumes of queries, by pre-computing and ...Andrea D’Ascenzo, Mattia D’Emidio
openaire +2 more sources
A Comparative Study of k-Shortest Path Algorithms
1996Efficient management of networks requires that the shortest route from one point (node) to another is known; this is termed the shortest path. It is often necessary to be able to determine alternative routes through the network, in case any part of the shortest path is damaged or busy.
A. W. Brander, M. C. Sinclair
openaire +1 more source
Improving Space Efficiency With Path Length Prediction for Finding $k$ Shortest Simple Paths
IEEE Transactions on Computers, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Comment on a computing the k shortest paths in a graph
Communications of the ACM, 1977In [1] Hardgrave discusses “positional” versus keyword parameter communication with subprograms from the viewpoint of structured programming. In this note an additional argument in favor of the keyword approach is suggested.
openaire +1 more source