Results 31 to 40 of about 524,063 (295)
Shortest Paths in Microseconds
CoRR, 2013 Extended version of WOSN'12 paper: new techniques (reduced memory, faster computations), distributed (MapReduce) algorithm, multiple paths between a source-destination ...
Rachit Agarwal 0001 +3 more
openaire +2 more sources
Discovery of network properties with all-shortest-paths queries
, 2008 We consider the problem of discovering properties (such as the diameter) of an unknown network G(V,E) with a minimum number of queries. Initially, only the vertex set V of the network is known. Information about the edges and non-edges of the network can
Thomas Rainer Erlebach (7687466) +3 more
core +5 more sources
On Universal Shortest Paths [PDF]
, 2011 The universal combinatorial optimization problem (Univ-COP) generalizes classical and new objective functions for combinatorial problems given by a ground set, a set of feasible solutions and costs assigned to the elements in the ground set. The corresponding universal objective function is of the sum type and associates additional multiplicative ...
Lara Turner, Horst W. Hamacher
openaire +2 more sources
Partially Disjoint k Shortest Paths [PDF]
, 2022 A solution of the $k$ shortest paths problem may output paths that are identical up to a single edge. On the other hand, a solution of the $k$ independent shortest paths problem consists of paths that share neither an edge nor an intermediate node.
Dolev, Shlomi +3 more
core +1 more source
Adaptive Dynamic Shortest Path Search Algorithm in Networks-on-Chip Based on Circulant Topologies
IEEE Access, 2021 A new pair routing algorithm for transmitting messages in multiprocessor systems and networks-on-chip based on circulant networks of arbitrary dimension is proposed.
Oleg G. Monakhov +4 more
doaj +1 more source
Comparing fuel-optimal and shortest paths with obstacle avoidance
Aviation, 2022 This paper presents a comparison of fuel-optimal and shortest paths of an unmanned combat aerial vehicle (UCAV) with obstacle avoidance. A nonlinear constrained optimization algorithm is applied to obtain the optimal paths. An initial value problem (IVP)
Ibrahim H. Cihan
doaj +1 more source
Approximation Algorithm for Shortest Path in Large Social Networks
Algorithms, 2020 Proposed algorithms for calculating the shortest paths such as Dijikstra and Flowd-Warshall’s algorithms are limited to small networks due to computational complexity and cost.
Dennis Nii Ayeh Mensah +2 more
doaj +1 more source
Dynamic Shortest Paths Methods for the Time-Dependent TSP
Algorithms, 2021 The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered.
Christoph Hansknecht +2 more
doaj +1 more source
MODELING OF EMERGENCY EVACUATION IN BUILDING FIRE [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 One of the main problems of rescue workers in confrontation of fired complex buildings is the lack of sufficient information about the building indoor environment and their emergency exit ways.
H. Bayat +5 more
doaj +1 more source
Effect of shortest path multiplicity on congestion of multiplex networks
New Journal of Physics, 2019 Shortest paths are representative of discrete geodesic distances in graphs, and many descriptors of networks depend on their counting. In multiplex networks, this counting is radically important to quantify the switch between layers and it has crucial ...
Albert Solé-Ribalta +2 more
doaj +1 more source