Results 1 to 10 of about 15,096 (164)
A Multi Label Algorithm for K Shortest Paths Problem [PDF]
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
Finding shortest and dissimilar paths [PDF]
International Transactions in Operational Research, 2021 AbstractThe purpose of the dissimilar paths problem is to find a set of paths, between the same pair of nodes, which share few arcs. The problem has been addressed from an application point of view, and integer programming formulations have also been introduced recently.
Moghanni A., Pascoal M., Godinho M. T.
openaire +2 more sources
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
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
Shortest Path Algorithms for Pedestrian Navigation Systems
Information, 2022 Efficient shortest path algorithms are of key importance for routing and navigation systems. However, these applications are designed focusing on the requirements of motor vehicles, and therefore, finding paths in pedestrian sections of urban areas is ...
Kyriakos Koritsoglou +3 more
doaj +1 more source
MULTI-CRITERIA PATH FINDING [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Path finding solutions are becoming a major part of many GIS applications including location based services and web-based GIS services. Most traditional path finding solutions are based on shortest path algorithms that tend to minimize the cost of travel
E. Mohammadi, A. Hunter
doaj +1 more source
A Load Balancing Shortest Path Routing Algorithm for SRIO Network [PDF]
Jisuanji gongcheng, 2020 Routing selection algorithms are one of the important factors affecting transmission performance during serial RapidIO transmission.Aiming at the non-optimal allocation path of Serial Rapid Input and Output(SRIO) network depth search,this paper proposes ...
LI Jiawei, ZHANG Ji, ZHAO Juncai, DING Ruyi
doaj +1 more source
On the K shortest path trees problem [PDF]
European Journal of Operational Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sedeño-Noda, Antonio +1 more
openaire +1 more source
Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
Моделирование и анализ информационных систем, 2013 The paper proposes an efficient associative algorithm for dynamic update of the shortest paths tree of a directed weighted graph after deleting an edge.
A. S. Nepomniaschaya
doaj +3 more sources
Partially Disjoint k Shortest Paths
, 2022 A solution of the $k$ shortest paths problem may output paths that are identical up to a single edge. On the other hand, a solution of the $k$ independent shortest paths problem consists of paths that share neither an edge nor an intermediate node.
Dinitz, Yefim +3 more
openaire +2 more sources