Results 61 to 70 of about 218,121 (185)
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
Optimization of transport protocols with path-length constraints in complex networks [PDF]
, 2010 We propose a protocol optimization technique that is applicable to both weighted or unweighted graphs. Our aim is to explore by how much a small variation around the Shortest Path or Optimal Path protocols can enhance protocol performance.
Boettcher, Stefan +3 more
core +2 more sources
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
Distributed Approximation Algorithms for Weighted Shortest Paths
, 2014 A distributed network is modeled by a graph having $n$ nodes (processors) and diameter $D$. We study the time complexity of approximating {\em weighted} (undirected) shortest paths on distributed networks with a $O(\log n)$ {\em bandwidth restriction} on
Abram J. +3 more
core +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
Physarum can compute shortest paths [PDF]
Journal of Theoretical Biology, 2012 Physarum Polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by biologists to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foraging two food sources s0 and s1.
Bonifaci V, Mehlhorn K, Varma G
openaire +10 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 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
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
ARP-Path: ARP-Based, Shortest Path Bridges [PDF]
IEEE Communications Letters, 2011 This letter is a summary proposal for an evolution of the Ethernet transparent bridge paradigm that provides simple, shortest path bridging in campus networks. ARP-Path Ethernet Switches set up an on-demand path between two hosts just reusing and flooding the standard ARP request frame through all links and confirming the path reaching to the ...
Ibáñez Fernández, Guillermo Agustín +4 more
openaire +3 more sources