Results 51 to 60 of about 1,034 (115)
Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles
Journal of Telecommunications and Information Technology, 2018 The paper presents a new algorithm to determine the shortest, non-crossing, rectilinear paths in a twodimensional grid graph. The shortest paths are determined in a manner ensuring that they do not cross each other and bypass any obstacles present. Such
Shylashree Nagaraja
doaj +1 more source
On the Number of Shortest Weighted Paths in a Triangular Grid
Mathematics, 2020 Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its
Benedek Nagy, Bashar Khassawneh
doaj +1 more source
The complexity of rerouting shortest paths [PDF]
Theoretical Computer Science, 2012 The results on claw-free graphs, chordal graphs and isolated paths have been added in version 2 (april 2012). Version 1 (September 2010) only contained the PSPACE-hardness result. (Version 2 has been submitted.)
openaire +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 +2 more sources
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
Engineering Shortest Path Algorithms [PDF]
, 2004 In this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra’s shortest path algorithm.
DEMETRESCU, Camil, Giuseppe F. Italiano
openaire +2 more sources
Observer of changes in the forest of the shortest paths on dynamic graphs of transport networks
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2020 The purpose of the work is the development of basic data structures, speed-efficient and memoryefficient algorithms for tracking changes in predefined decisions about sets of shortest paths on transport networks, notifications about which are received by
N. V. Khajynova +2 more
doaj +1 more source
Shortest-Path Reconstruction Algorithms [PDF]
The Computer Journal, 1993 Summary: We study the problem of computing shortest paths between pairs of vertices in an \(n\)-vertex graph, given only the all pairs shortest paths distance matrix. This computation is called a reconstruction, since the algorithm has no access to explicit information about edges in the original graph. We present the following results: 1.
openaire +2 more sources
Secluded Path via Shortest Path [PDF]
, 2014 We provide several new algorithmic results for the secluded path problem, specifically approximation and optimality results for the static algorithm of [3,5], and an extension (h-Memory) of it based on de Bruijn graphs, when applied to bounded degree graphs and some other special graph classes which can model wireless communication and line-of-sight ...
Matthew P. Johnson 0001 +2 more
openaire +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