Results 21 to 30 of about 524,063 (295)
Finding Shortest Paths With Computational Geometry
Journal of Graph Algorithms and Applications, 2003 We present a heuristic search algorithm for the Rd Manhattan shortest path problem that achieves front-to-front bidirectionality in subquadratic time. In the study of bidirectional search algorithms, front-to-front heuristic computations were thought ...
Po-Shen Loh
doaj +1 more source
Problems on Shortest k-Node Cycles and Paths
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph.
Petro Stetsyuk +2 more
doaj +1 more source
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Darmann +2 more
openaire +2 more sources
How to Compose Shortest Paths [PDF]
, 2022 The composition problem for shortest paths asks the following: given shortest paths on weighted graphs M and N which share a common boundary, find the shortest paths on their union.
Master, Jade
core +1 more source
Determination of the Maximum Set Independent Simple Paths between the Vertices of the Graph
Современные информационные технологии и IT-образование, 2021 This article presents an algorithm for determining the maximum number of independent simple paths, as well as the paths themselves, between the given vertices of the graph.
Yulia Terentyeva
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
Constructing Effective Caches of Shortest Path Queries on Road Networks
IEEE Access, 2020 How to effectively utilize caching technology to support high-performance shortest path queries on road networks has become an important research problem since the popularization of location-based services.
Xiaohua Li +4 more
doaj +1 more source
Shortest shortest path trees of a network
Discrete Applied Mathematics, 1996 If \(N\) is an undirected network where each edge has positive length, we may consider the distances of vertices from a specified internal point of an edge. A shortest path tree (SPT) rooted at \(s\) (possibly an internal point of an edge) is a spanning tree \(T\) of the network \(N[s]\) (i.e., \(N\) with \(s\) as possibly a new vertex) where for each ...
Pierre Hansen, Maolin Zheng
openaire +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
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