Results 21 to 30 of about 286,038 (288)
A machine learning approach for predicting human shortest path task performance
Visual Informatics, 2022 Finding a shortest path for a given pair of vertices in a graph drawing is one of the fundamental tasks for qualitative evaluation of graph drawings.
Shijun Cai +4 more
doaj +1 more source
Two-degree-of-freedom manipulator path planning based on zeroing neural network [PDF]
MATEC Web of Conferences, 2020 In this paper, the shortest path problem of manipulator path planning is transformed into a linear programming problem, and solved by zeroing neural network (ZNN).
Li Yan, Liu Keping
doaj +1 more source
Speed-up Technique in Time-Varying Shortest Path Problems with Arbitrary Waiting Times [PDF]
مدیریت مهندسی و رایانش نرم, 2020 Network flow problems are considered a vital branch of operations research. These problems are classified into static and time-varying classes. Network flow problems are time-varying in real application, because any flow must take a given amount of time ...
Gholamhasan Shirdel, Hasan Rezapour
doaj +1 more source
ON ASSOCIATIVE SHORTEST PATH PROBLEMS [PDF]
Bulletin of informatics and cybernetics, 1997 Summary: We consider a wide class of shortest path problems in acyclic digraphs. In the problems, the length of a path is defined by using an associative binary operation. We derive recursive equations in dynamic programming for the problems, which involve additive, multiplicative, multiplicative-additive, minimum and fractional shortest path problems.
openaire +2 more sources
The Capacity Expansion Path Problem in Networks
Journal of Applied Mathematics, 2013 This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial
Jianping Li, Juanping Zhu
doaj +1 more source
Reachability and Shortest Paths in the Broadcast CONGEST Model [PDF]
, 2019 In this paper we study the time complexity of the single-source reachability problem and the single-source shortest path problem for directed unweighted graphs in the Broadcast CONGEST model.
Chechik, Shiri, Mukhtar, Doron
core +2 more sources
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles [PDF]
, 2019 Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings via alternating cycles. Namely, we want to find a shortest sequence of perfect matchings which transforms one given perfect matching ...
Ito, Takehiro +4 more
core +2 more sources
Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph [PDF]
Neutrosophic Sets and Systems, 2019 One of the important non-linear data structures in Computer Science is graph. Most of the real life network, be it a road transportation network, or airlines network or a communication network etc., cannot be exactly transformed into a graph model, but ...
Siddhartha Sankar Biswas
doaj +1 more source
Rerouting shortest paths in planar graphs [PDF]
, 2012 A rerouting sequence is a sequence of shortest st-paths such that consecutive paths differ in one vertex. We study the the Shortest Path Rerouting Problem, which asks, given two shortest st-paths P and Q in a graph G, whether a rerouting sequence exists ...
Bonsma, Paul
core +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 +1 more source