Results 31 to 40 of about 32,209 (302)
Approximation Algorithm for Shortest Path in Large Social Networks
Algorithms, 2020 Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall’s algorithms are limited to small networks due to computational complexity and cost.
Dennis Nii Ayeh Mensah +2 more
doaj +1 more source
Comparing fuel-optimal and shortest paths with obstacle avoidance
Aviation, 2022 This paper presents a comparison of fuel-optimal and shortest paths of an unmanned combat aerial vehicle (UCAV) with obstacle avoidance. A nonlinear constrained optimization algorithm is applied to obtain the optimal paths. An initial value problem (IVP)
Ibrahim H. Cihan
doaj +1 more source
Finding an induced path that is not a shortest path [PDF]
Discrete Mathematics, 2021 We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
Eli Berger +2 more
openaire +3 more sources
Dynamic Shortest Paths Methods for the Time-Dependent TSP
Algorithms, 2021 The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered.
Christoph Hansknecht +2 more
doaj +1 more source
MODELING OF EMERGENCY EVACUATION IN BUILDING FIRE [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 One of the main problems of rescue workers in confrontation of fired complex buildings is the lack of sufficient information about the building indoor environment and their emergency exit ways.
H. Bayat +5 more
doaj +1 more source
Shortest Paths in Microseconds
CoRR, 2013 Extended version of WOSN'12 paper: new techniques (reduced memory, faster computations), distributed (MapReduce) algorithm, multiple paths between a source-destination ...
Rachit Agarwal 0001 +3 more
openaire +2 more sources
MULTI-CRITERIA PATH FINDING [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Path finding solutions are becoming a major part of many GIS applications including location based services and web-based GIS services. Most traditional path finding solutions are based on shortest path algorithms that tend to minimize the cost of travel
E. Mohammadi, A. Hunter
doaj +1 more source
Effect of shortest path multiplicity on congestion of multiplex networks
New Journal of Physics, 2019 Shortest paths are representative of discrete geodesic distances in graphs, and many descriptors of networks depend on their counting. In multiplex networks, this counting is radically important to quantify the switch between layers and it has crucial ...
Albert Solé-Ribalta +2 more
doaj +1 more source
All-Pairs Shortest Paths in Geometric Intersection Graphs
Journal of Computational Geometry, 2019 $\newcommand{\OO}[1]{O\left(#1\right)}$We present a simple and general algorithm for the all-pairs shortest paths (APSP) problem in unweighted geometric intersection graphs.
Timothy M. Chan, Dimitrios Skrepetos
doaj +1 more source
bsmock/k-shortest-paths: First official major release
, 2017 <p>This is the first official major release of the k-shortest-paths repository. It contains implementations of three well-known algorithms (Yen, Eppstein, and Lazy Eppstein), as well as a simplified version of Eppstein's algorithm that may be ...
Brandon Smock
core +1 more source