Results 51 to 60 of about 49,625 (158)
Shortest Path Network Interdiction With Goal Threshold
IEEE Access, 2018 Network defense and attack problems can be modeled as network interdictions. In this paper, we consider a new version of the network interdiction problem that optimizes the interdictor's resource consumption while limiting network capacities (e.g., the ...
Xiangyu Wei +4 more
doaj +1 more source
MathematicsThe shortest path problem is fundamental in graph theory and has been studied extensively due to its practical importance. Despite this aspect, finding the shortest path between two nodes remains a significant challenge in many applications, as it often ...
Adrien Durand +3 more
doaj +1 more source
Rapid Generation of the Shortest Generalized Dubins Path in Forced Landing
International Journal of Applied Mathematics and Computer ScienceThis paper investigates the problem of rapid shortest path generation during an aircraft’s forced landing, where the heading angle of the target point is variable.
Tian Min +3 more
doaj +1 more source
Promet (Zagreb), 2014 In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems.
Mario Miler +2 more
doaj +1 more source
The Algorithm for Solving Shortest-Path Problems Based on Electrical Circuit Laws [PDF]
Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2011 Shortest-path problem is one of the well-known optimization problems that has been studied by many scientists in recent years. Applications of this problem such as transportation and communication are generally solved by Dijkstra's Algorithm (Labeling ...
Ali Khatami Firoozabadi +2 more
doaj
Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]
, 2005 We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries.
Ekkehard Köhler +2 more
openaire +1 more source
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
On the shortest path problem of uncertain random digraphs. [PDF]
Soft comput, 2022 Li H, Zhang K.
europepmc +1 more source
Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping. [PDF]
Nat Commun, 2023 Kitsak M +7 more
europepmc +1 more source
Comparing models of information transfer in the structural brain network and their relationship to functional connectivity: diffusion versus shortest path routing. [PDF]
Brain Struct Funct, 2023 Neudorf J, Kress S, Borowsky R.
europepmc +1 more source