Results 31 to 40 of about 1,848,326 (324)
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
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models [PDF]
International Symposium on Distributed Computing, 2016 We present a method for solving the shortest transshipment problem - also known as uncapacitated minimum cost flow - up to a multiplicative error of (1 + epsilon) in undirected graphs with non-negative integer edge weights using a tailored gradient ...
R. Becker +3 more
semanticscholar +1 more source
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
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 A (β, ∈)-hopset for a weighted undirected n-vertex graph G = (V, E) is a set of edges, whose addition to the graph guarantees that every pair of vertices has a path between them that contains at most β edges, whose length is within 1 + ∈ of the shortest ...
Michael Elkin, Ofer Neiman
semanticscholar +1 more source
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2017 Fine-grained reductions have established equivalences between many core problems with $\tilde{O}(n^3)$-time algorithms on $n$-node weighted graphs, such as Shortest Cycle, All-Pairs Shortest Paths (APSP), Radius, Replacement Paths, Second Shortest Paths,
Andrea Lincoln +2 more
semanticscholar +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