Results 21 to 30 of about 1,848,326 (324)
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
Reconfiguring Shortest Paths in Graphs. [PDF]
Algorithmica, 2022 AbstractReconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths. This problem has several natural applications, namely: (a) repaving road networks, (b) rerouting data packets in a synchronous multiprocessing setting, (c) the ...
Gajjar K, Jha AV, Kumar M, Lahiri A.
europepmc +4 more sources
Shortest Paths in a Hybrid Network Model [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2019 We introduce a communication model for hybrid networks, where nodes have access to two different communication modes: a local mode where communication is only possible between specific pairs of nodes, and a global mode where communication between any ...
John E. Augustine +4 more
semanticscholar +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
Shortest paths between shortest paths
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaminski, Marcin +2 more
openaire +1 more source
On the Structure of Unique Shortest Paths in Graphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2018 This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can appear as unique shortest paths in a graph with arbitrary ...
Gregory Bodwin
semanticscholar +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 Paths Avoiding Forbidden Subpaths [PDF]
, 2009 In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P.
Ahmed, Mustaq, Lubiw, Anna
core +6 more sources
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‐path network interdiction
Networks, 2002 AbstractWe study the problem of interdicting the arcs in a network in order to maximize the shortest s–t path length. “Interdiction” is an attack on an arc that destroys the arc or increases its effective length; there is a limited interdiction budget.
Israeli, E., Wood, R.K.
openaire +3 more sources