Results 31 to 40 of about 371,797 (314)
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.
Bang-Jensen +5 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.
Köhler, Ekkehard +2 more
openaire +2 more sources
A Novel Method for Solving Multi-objective Shortest Path Problem in Respect of Probability Theory
Tehnički Glasnik, 2023 Transportation process or activity can be considered as a multi-objective problem reasonably. However, it is difficult to obtain an absolute shortest path with optimizing the multiple objectives at the same time by means of Pareto approach. In this paper,
Maosheng Zheng, Jie Yu
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
Distance distribution in configuration model networks [PDF]
, 2016 We present analytical results for the distribution of shortest path lengths between random pairs of nodes in configuration model networks. The results, which are based on recursion equations, are shown to be in good agreement with numerical simulations ...
Biham, Ofer +3 more
core +2 more sources
Shortest Dubins path to a circle [PDF]
AIAA Scitech 2019 Forum, 2019 The Dubins path problem had enormous applications in path planning for autonomous vehicles. In this paper, we consider a generalization of the Dubins path planning problem, which is to find a shortest Dubins path that starts from a given initial position and heading, and ends on a given target circle with the heading in the tangential direction.
Alexander Von Moll +3 more
openaire +3 more sources
Shortest path routing algorithm for hierarchical interconnection network-on-chip [PDF]
, 2015 Interconnection networks play a significant role in efficient on-chip communication for multicore systems. This paper introduces a new interconnection topology called the Hierarchical Cross Connected Recursive network (HCCR) and a shortest path routing ...
Al Khanjari, Sharifa +2 more
core +1 more source
On the Maximal Shortest Paths Cover Number
Mathematics, 2021 A shortest path P of a graph G is maximal if P is not contained as a subpath in any other shortest path. A set S⊆V(G) is a maximal shortest paths cover if every maximal shortest path of G contains a vertex of S.
Iztok Peterin, Gabriel Semanišin
doaj +1 more source
Generalized Shortest Path Kernel on Graphs
, 2015 We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes.
A Fronczak +6 more
core +1 more source
Percolating paths through random points : [PDF]
, 2005 We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process.
Aldous, David, Krikun, Maxim
core +4 more sources