Results 41 to 50 of about 371,797 (314)
Shortest shortest path trees of a network
Discrete Applied Mathematics, 1996 Abstract Let N = (V, E) be an undirected network with n vertices and m edges (i.e., ¦V¦ = n and ¦E¦ = m ) in which each edge has a positive length. We study the length of the shortest path trees of N rooted at x (the length of a shortest path tree is defined to be the sum of the lengths of its edges) and the sum of distances from x to all (
Maolin Zheng, Pierre Hansen
openaire +2 more sources
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
Privacy-Preserving Shortest Path Computation
, 2016 Navigation is one of the most popular cloud computing services. But in virtually all cloud-based navigation systems, the client must reveal her location and destination to the cloud service provider in order to learn the fastest route.
Mitchell, John C. +3 more
core +1 more source
Shortest path discovery of complex networks [PDF]
, 2008 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.
A. Lakhina +4 more
core +2 more sources
On the Quadratic Shortest Path Problem [PDF]
, 2015 Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the ...
Rostami, Borzou +3 more
openaire +4 more sources
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
IEEE Access, 2021 The clustered shortest-path tree problem (CluSPTP) is an extension of the classical single-source shortest-path problem, in which, given a graph with the set of nodes partitioned into a predefined, mutually exclusive and exhaustive set of clusters, we ...
Ovidiu Cosma +2 more
doaj +1 more source
Computing a rectilinear shortest path amid splinegons in plane
, 2017 We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain \calS to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define
DP Dobkin +16 more
core +1 more source
Cooperative strategy to reduce path length in risky environments
Tecnura, 2023 Objective: Design an artificial intelligence system based on information from the environment that can recommend the shortest path to an individual or vehicle, or robot that moves between two points with the lowest risk of contagion with coronavirus ...
José Andrés Chaves Osorio +2 more
doaj +1 more source
Speeding up shortest path algorithms
, 2012 Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in ...
A.V. Goldberg +10 more
core +1 more source
Shortest Paths in Reachability Graphs
Journal of Computer and System Sciences, 1993 AbstractWe prove the following property for safe marked graphs, safe conflict-free Petri nets, and live and safe extended free-choice Petri nets: Given two markings M1, M2 of the reachability graph, if some path leads from M1 to M2, then some path of polynomial length in the number of transitions of the net leads from M1 to M2.
Desel, Jörg, Esparza, Javier
openaire +3 more sources