Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks [PDF]
arXiv, 2010 A problem studied in Systems Biology is how to find shortest paths in metabolic networks. Unfortunately, simple (i.e., graph theoretic) shortest paths do not properly reflect biochemical facts. An approach to overcome this issue is to use edge labels and search for paths with distinct labels.
arxiv
L. A. Lyusternik, Shortest Paths–Variational Problems (Popular Lectures in Mathematics, Pergamon Press, Oxford, 1964), x+102 pp., 17s. 6d. [PDF]
, 1966 R. P. Gillespie
openalex +1 more source
Constrained shortest paths and related problems
, 2001 The classical shortest path problem, to find a path of minimal cost between two nodes in a graph, is efficiently solvable in polynomial time. However, in many applications we also have additional budget or resource constraints on a path. This problem is known as constrained shortest path problem and unfortunately belongs to the class of "hard" problems
openaire +3 more sources
Computing shortest paths in 2D and 3D memristive networks
, 2013 Global optimisation problems in networks often require shortest path length computations to determine the most efficient route. The simplest and most common problem with a shortest path solution is perhaps that of a traditional labyrinth or maze with a ...
Prodromakis, Themistoklis +2 more
core
Computing L1 Shortest Paths among Polygonal Obstacles in the Plane [PDF]
arXiv, 2012 Given a point $s$ and a set of $h$ pairwise disjoint polygonal obstacles of totally $n$ vertices in the plane, we present a new algorithm for building an $L_1$ shortest path map of size O(n) in $O(T)$ time and O(n) space such that for any query point $t$, the length of the $L_1$ shortest obstacle-avoiding path from $s$ to $t$ can be reported in $O(\log
arxiv
Link distance and shortest path problems in the plane
Computational Geometry, 2009 AbstractThis paper describes algorithms to compute Voronoi diagrams, shortest path maps, the Hausdorff distance, and the Fréchet distance in the plane with polygonal obstacles. The underlying distance measures for these algorithms are either shortest path distances or link distances.
Atlas F. Cook, Carola Wenk
openaire +5 more sources
A parallel shortest augmenting path algorithm for the assignment problem [PDF]
, 1991 Egon Balas +3 more
openalex +1 more source
Robust time-varying shortest path with arbitrary waiting time at vertices
Croatian Operational Research Review, 2017 In this paper, we propose an algorithm for solving the robust time varying shortest path problem in which the waiting time at any vertex is not restricted. The problem is to find the shortest path connecting source node s and sink node i in a timevarying
Gholamhassan Shirdel, Hassan Rezapour
doaj +1 more source
An Analysis of Stochastic Shortest Path Problems [PDF]
, 1991 Dimitri P. Bertsekas, John N. Tsitsiklis
openalex +1 more source
A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets [PDF]
Journal of Optimization in Industrial Engineering, 2013 A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced
Sadollah Ebrahimnejad +2 more
doaj