Results 21 to 30 of about 32,209 (302)
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
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
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Darmann +2 more
openaire +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
Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies
IEEE Access, 2021 A new pair routing algorithm for transmitting messages in multiprocessor systems and networks-on-chip based on circulant networks of arbitrary dimension is proposed.
Oleg G. Monakhov +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
Drawing Shortest Paths in Geodetic Graphs [PDF]
, 2022 Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph G, i.e., an unweighted graph in which the shortest path between any pair of vertices
Pfister, Maximilian; orcid: +6 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
On Universal Shortest Paths [PDF]
, 2011 The universal combinatorial optimization problem (Univ-COP) generalizes classical and new objective functions for combinatorial problems given by a ground set, a set of feasible solutions and costs assigned to the elements in the ground set. The corresponding universal objective function is of the sum type and associates additional multiplicative ...
Lara Turner, Horst W. Hamacher
openaire +1 more source
Counting Vertex-Disjoint Shortest Paths in Graphs
, 2021 Finding a shortest path in a graph is at the core of many combinatorial search problems. A closely related problem refers to counting the number of shortest paths between two nodes.
Marinescu, Radu +4 more
core +1 more source