Results 251 to 260 of about 190,109 (292)

Finding the k shortest paths in parallel

Algorithmica, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sevdalin Tsvetanov, Daniela Marinova
openaire   +2 more sources

Finding Top-k Shortest Paths with Diversity

2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018
The classical K Shortest Paths (KSP) problem, which identifies the k shortest paths in a directed graph, plays an important role in many application domains, such as providing alternative paths for vehicle routing services. However, the returned k shortest paths may be highly similar, i.e., sharing significant amounts of edges, thus adversely affecting
Huiping Liu, Cheqing Jin, Bin Yang, Aoying Zhou   +3 more
openaire   +3 more sources

A note on k-shortest paths problem

Journal of Graph Theory, 2010
Summary: It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices \(s\) and \(t\), then there are two edge-disjoint paths from \(s\) to \(t\) and both of them are shortest paths.
Gravin, Nick, Chen, Ning
openaire   +1 more source

Finding all hops k-shortest paths

2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490), 2004
In this paper, we introduce and investigate a new problem referred to as the all hops k-shortest paths (AHKP) problem. An efficient solution, the all hops k-shortest paths extended Bellman-Ford (AHKPEB) algorithm, is proposed. Especially, when k = 1, AHKPEB is an optimal comparison-based solution to the all hops optimal path (AHOP) problem in terms of ...
null Gang Cheng, N. Ansari
openaire   +1 more source

k-PathA: k-shortest Path Algorithm

2009 International Workshop on High Performance Computational Systems Biology, 2009
One important aspect of computational systems biology includes the identification and analysis of functional response networks within large biochemical networks. These functional response networks represent the response of a biological system under a particular experimental condition which can be used to pinpoint critical biological processes.For this ...
Alexander Ullrich, Christian V. Forst
openaire   +1 more source

Path enumeration by finding the constrained K-shortest paths

Transportation Research Part B: Methodological, 2005
This paper deals with algorithms for finding the constrained K-shortest paths (CKSP) and their application to the path enumeration problem. An attractive property of using Constrained Shortest Paths for path enumeration is that paths can be selected based on objective criteria.
N.J. van der Zijpp, S. Fiorenzo Catalano
openaire   +1 more source

Degree Anonymization for K-Shortest-Path Privacy

2013 IEEE International Conference on Systems, Man, and Cybernetics, 2013
Preserving privacy in social networking environment has been studied extensively in recent years. Although more works have adopted un-weighted graphs to model network relationships, weighted graph modeling can provide deeper analysis of the degree of relationships.
Shyue-Liang Wang, Ching-Chuan Shih, I-Hsien Ting, Tzung-Pei Hong   +3 more
openaire   +1 more source

DNA Implementation of k-shortest Paths Computation

2005 IEEE Congress on Evolutionary Computation, 2005
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonucleotides and the length of the path is directly proportional to the length of oligonucleotides.
Z. Ibrahim, Y. Tsuboi, M.S. Muhammad, O. Ono, M. Khalid   +4 more
openaire   +1 more source

Parallel Asynchronous Algorithms for the K Shortest Paths Problem

Journal of Optimization Theory and Applications, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GUERRIERO, Francesca, MUSMANNO, Roberto
openaire   +3 more sources

Top-k Shortest Paths in Directed Labeled Multigraphs

2016
A top-k shortest path algorithm finds the k shortest paths of a given graph ordered by length. Interpreting graphs as RDF may lead to additional constraints, such as special loop restrictions or path patterns. Thus, traditional algorithms such as the ones by Dijkstra, Yen or Eppstein cannot be applied without further ado.
Hertling, Sven, Schröder, Markus, Jilek, Christian, Dengel, Andreas   +3 more
openaire   +1 more source