Results 11 to 20 of about 524,063 (295)
Shortest paths between shortest paths [PDF]
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcin Kaminski 0001 +2 more
openaire +4 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
top-k Path Greedy Generalization Algorithm of Anonymity Shortest Path [PDF]
Jisuanji gongcheng, 2016 With the development of social networks,the issues of privacy preservation arouse extensive attention.It can cause privacy disclosure of the shortest path if weighted social network data are protected before its publication.In order to solve this issue ...
CHEN Weihe,DING Leilei
doaj +1 more source
The College Mathematics Journal, 2021 35 pages, including 3 appendices and program ...
Richard Goldstone +2 more
openaire +2 more sources
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 +4 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
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 +2 more sources
Finding next-to-shortest paths in a graph [PDF]
, 2004 We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
Krasikov, I +3 more
core +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 +4 more sources