Results 11 to 20 of about 32,209 (302)
Shortest paths between shortest paths
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcin Kaminski 0001 +2 more
openaire +3 more sources
A Multi Label Algorithm for K Shortest Paths Problem
Communications, 2009 The paper presents an algorithm for computing k shortest walks or k shortest paths in a directed graph G (V, A). The proposed algorithm can be applied for solving the k shortest paths problem in an undirected graph G (V, E), too, by transforming the ...
Stanislav Paluch
doaj +2 more sources
On Dynamic Shortest Paths Problems [PDF]
Algorithmica, 2004 From the authors' abstract: ``We obtain the following results related to dynamic versions of the shortest-paths problem:'' (i) ``Reductions that show that the incremental and decremental single-source shortest-paths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static all-pairs shortest-paths ...
Liam Roditty, Uri Zwick
openaire +3 more sources
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
Shortest Paths between Shortest Paths and Independent Sets [PDF]
, 2011 We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length.
Kaminski, Marcin +2 more
openaire +3 more sources
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 with ordinal weights [PDF]
European Journal of Operational Research, 2020 24 pages, 8 figures, 2 ...
Luca E. Schäfer +4 more
openaire +3 more sources
Acceleration of Shortest Path and Constrained Shortest Path Computation [PDF]
, 2005 We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries.
Ekkehard Köhler +2 more
openaire +1 more source