Results 21 to 30 of about 47,764 (259)
Promet (Zagreb), 2014 In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems.
Mario Miler +2 more
doaj +1 more source
Journal of Advanced Transportation, 2023 Theoretical research is conducted on finding the shortest path with stochastic and time-dependent characteristics of link travel time in urban road networks.
Yanming Sun, Jie Li, Shixian Liu
doaj +1 more source
Shortest Path Finding in Quantum Networks With Quasi-Linear Complexity
IEEE Access, 2023 A fully-quantum network implies the creation of quantum entanglement between a given source node and some other destination node, with a number of quantum repeaters in between.
Sara Santos +3 more
doaj +1 more source
Upgrading Shortest Paths in Networks [PDF]
, 2011 We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to wildlife habitat conservation. We define the problem in terms of a network with node delays and a set of node upgrade actions, each associated with a cost and an upgraded ...
Bistra Dilkina +2 more
openaire +1 more source
Shortest path discovery of complex networks [PDF]
Physical Review E, 2009 In this paper we present an analytic study of sampled networks in the case of some important shortest-path sampling models. We present analytic formulas for the probability of edge discovery in the case of an evolving and a static network model. We also show that the number of discovered edges in a finite network scales much slower than predicted by ...
Fekete A., Vattay G., Posfai M.
openaire +4 more sources
CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
International Journal of Distributed Sensor Networks, 2017 Unlike traditional transmission control protocol/Internet protocol–based networks, delay/disruption tolerant networks may experience connectivity disruptions and guarantee no end-to-end connectivity between source and destination.
Michael Stewart +3 more
doaj +1 more source
Maritime Transport Network in Korea: Spatial-Temporal Density and Path Planning
Journal of Marine Science and Engineering, 2023 The increase in maritime traffic and vessel size has strengthened the need for economical and safe maritime transportation networks. Currently, ship path planning is based on past experience and shortest route usage. However, the increasing complexity of
Jeong-Seok Lee +2 more
doaj +1 more source
ISPRS International Journal of Geo-Information, 2022 The ability to quickly calculate or query the shortest path distance between nodes on a road network is essential for many real-world applications. However, the traditional graph traversal shortest path algorithm methods, such as Dijkstra and Floyd ...
Xu Chen +6 more
doaj +1 more source
Shortest paths and centrality in uncertain networks
Proceedings of the VLDB Endowment, 2021 Computing the shortest path between a pair of nodes is a fundamental graph primitive, which has critical applications in vehicle routing, finding functional pathways in biological networks, survivable network design, among many others. In this work, we study shortest-path queries over uncertain networks, i.e., graphs where every edge is ...
Arkaprava Saha +4 more
openaire +2 more sources
Shortest-Path Routing in Arbitrary Networks
Journal of Algorithms, 1999 Summary: We introduce an on-line protocol which routes any set of \(N\) packets along shortest paths with congestion \(C\) and dilation \(D\) through an arbitrary network in \(O(C+D+\log N)\) steps, with high probability. This time bound is optimal up to the additive \(\log N\), and it has previously only been reached for bounded-degree leveled ...
Friedhelm Meyer auf der Heide +1 more
openaire +1 more source