Results 11 to 20 of about 218,121 (185)
Iterative Algorithm for Finding the Shortest Ways in an Unweighted Undirected Graph
Современные информационные технологии и IT-образование, 2021 There is a problem of finding the shortest paths between two vertices in an unweighted, undirected graph, which is aggravated by the fact that the available algorithms for finding all paths have a complexity of at least .
Valentin Sysoev
doaj +1 more source
Representative dissimilar path queries: accommodating human movement dynamics in road networks
Journal of Spatial Information Science, 2023 We introduce a representative dissimilar path (RDP) query, a novel type of path query in road networks. The k representative paths (RPs) between a source and a destination locations have k smallest costs for a feature (e.g., length, number of road ...
Tanzima Hashem +3 more
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
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
Finding $k$ Simple Shortest Paths and Cycles [PDF]
, 2016 The problem of finding multiple simple shortest paths in a weighted directed graph $G=(V,E)$ has many applications, and is considerably more difficult than the corresponding problem when cycles are allowed in the paths. Even for a single source-sink pair,
Agarwal, Udit, Ramachandran, Vijaya
core +2 more sources
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
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