Results 71 to 80 of about 218,121 (185)
PLoS ONE, 2022 In this article, a new path planning algorithm is proposed. The algorithm is developed on the basis of the algorithm for finding the best value using multi-objective evolutionary particle swarm optimization, known as the MOEPSO. The proposed algorithm is
Ittikon Thammachantuek, Mahasak Ketcham
doaj +1 more source
Computing all shortest passenger routes with a tropical Dijkstra algorithm
EURO Journal on Transportation and LogisticsGiven a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account?
Berenike Masing +2 more
doaj +1 more source
An Efficient Approximation of Betweenness Centrality for Uncertain Graphs
IEEE Access, 2019 Betweenness centrality measures the centrality of nodes and edges in a graph based on the concept of shortest paths. However, such a definition is unsuitable for uncertain graphs due to the uncertainty of links. In the possible-world semantics, the Monte
Chenxu Wang, Ziyuan Lin
doaj +1 more source
Shortest path counting in probabilistic biological networks
BMC Bioinformatics, 2018 Background Biological regulatory networks, representing the interactions between genes and their products, control almost every biological activity in the cell.
Yuanfang Ren, Ahmet Ay, Tamer Kahveci
doaj +1 more source
Improved Distributed Algorithms for Exact Shortest Paths
, 2018 Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et ...
A +3 more
core +1 more source
Shortest-weight paths in random regular graphs [PDF]
, 2012 Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight ...
Amini, Hamed, Peres, Yuval
core +1 more source
Finding k-Dissimilar Paths with Minimum Collective Length
, 2018 Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough.
Blumenthal, David B. +4 more
core +1 more source
Faster all-pairs shortest paths via circuit complexity
, 2014 We present a new randomized method for computing the min-plus product (a.k.a., tropical product) of two $n \times n$ matrices, yielding a faster algorithm for solving the all-pairs shortest path problem (APSP) in dense $n$-node directed graphs with ...
Aho Alfred V. +3 more
core +1 more source
Exact Geosedics and Shortest Paths on Polyhedral Surface [PDF]
, 2007 We present two algorithms for computing distances along a non-convex polyhedral surface. The first algorithm computes exact minimal-geodesic distances and the second algorithm combines these distances to compute exact shortest-path distances along the ...
Balasubramanian, Mukund +2 more
core +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 +1 more source