Results 21 to 30 of about 218,121 (185)
HETEROGENIOUS BLOCKED ALL-PAIRS SHORTEST PATHS ALGORITHM
Системный анализ и прикладная информатика, 2017 The problem of finding the shortest paths between all pairs of vertices in a weighted directed graph is considered. The algorithms of Dijkstra and Floyd-Warshall, homogeneous block and parallel algorithms and other algorithms of solving this problem are ...
A. A. Prihozhy, O. N. Karasik
doaj +1 more source
A single-source shortest path algorithm for dynamic graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Graphs are mathematical structures used in many applications. In recent years, many applications emerged that require the processing of large dynamic graphs where the graph’s structure and properties change constantly over time.
Muteb Alshammari, Abdelmounaam Rezgui
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
Near-shortest and K-shortest simple paths
Networks, 2005 Summary: We present a new algorithm for enumerating all near-shortest simple (loopless) \(s\)-\(t\) paths in a graph \(G=(V,E)\) with nonnegative edge lengths. Letting \(n=|V|\) and \(m=|E|\), the time per path enumerated is \(O(nS(n,m))\) given a user-selected short-est-path subroutine with complexity \(O(S(n,m))\).
Carlyle, W. Matthew, Wood, R .Kevin
openaire +2 more sources
Finding next-to-shortest paths in a graph [PDF]
, 2004 We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
Bang-Jensen +5 more
core +1 more source
Routing Algorithms with Range Restriction in Sparse Supply Networks
Journal of Algorithms & Computational Technology, 2013 Shortest paths are computed for vehicles with comparatively small maximum range so that they must refuel, recharge or change batteries along a single trip in a road network. Heuristic solutions are given as well as exact algorithms.
Thomas Kämpke
doaj +1 more source
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
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