Results 81 to 90 of about 550,853 (271)
Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
, 2017 Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core
On the minimum eccentricity shortest path problem
Theoretical Computer Science, 2015 Abstract In this paper, we introduce and investigate the Minimum Eccentricity Shortest Path (MESP) problem in unweighted graphs. It asks for a given graph to find a shortest path with minimum eccentricity. Let n and m denote the number of vertices and the number of edges of a given graph. We demonstrate that: • a minimum eccentricity shortest path
Feodor F. Dragan, Arne Leitert
openaire +3 more sources
“rsppfp”: An R package for the shortest path problem with forbidden paths
SoftwareX, 2019 The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution.
Melina Vidoni, Aldo Vecchietti
doaj
Distributed algorithms from arboreal ants for the shortest path problem. [PDF]
Proc Natl Acad Sci U S A, 2023 Garg S +3 more
europepmc +1 more source
An Efficient Algorithm for Touring n Circles
MATEC Web of Conferences, 2018 This paper proposed an intelligent algorithm, which can build the shortest path of the intersecting circle sequences in the plane. The problem is transformed to a corresponding problem of computing the shortest path of three disjoint circles.
Ding Yuepeng, Xie Xiong, Jiang Bo
doaj +1 more source
On the shortest path problem of uncertain random digraphs. [PDF]
Soft comput, 2022 Li H, Zhang K.
europepmc +1 more source
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
Discussiones Mathematicae Graph Theory, 2014 A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1 ...
Short Ian
doaj +1 more source
K shortest paths in stochastic time-dependent networks [PDF]
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan +2 more
core
Solving the Robust Shortest Path Problem with Multimodal Transportation
MathematicsThis paper explores the challenges of finding robust shortest paths in multimodal transportation networks. With the increasing complexity and uncertainties in modern transportation systems, developing efficient and reliable routing strategies that can ...
Jinzuo Guo +3 more
doaj +1 more source