Results 81 to 90 of about 218,121 (185)
Системный анализ и прикладная информатикаThe problem of finding all shortest paths between vertices in a graph (APSP) has real-life applications in planning, communication, economics and many other areas.
O. N. Karasik, A. A. Prihozhy
doaj +1 more source
“rsppfp”: An R package for the shortest path problem with forbidden paths
SoftwareX, 2019 The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution.
Melina Vidoni, Aldo Vecchietti
doaj +1 more source
Computing shortest paths in 2D and 3D memristive networks
, 2013 Global optimisation problems in networks often require shortest path length computations to determine the most efficient route. The simplest and most common problem with a shortest path solution is perhaps that of a traditional labyrinth or maze with a ...
Prodromakis, Themistoklis +2 more
core
Routes Obey Hierarchy in Complex Networks
Scientific Reports, 2017 The last two decades of network science have discovered stunning similarities in the topological characteristics of real life networks (many biological, social, transportation and organizational networks) on a strong empirical basis.
Attila Csoma +9 more
doaj +1 more source
Transportation network reduction [PDF]
Transport Problems, 2015 Network reduction problem is formulated as follows: We are given a transportation network T, a set of important origin – destination relations R and a number q greater than 1.
Stanislav PALÚCH +3 more
doaj
SIAM Journal on Computing, 1998 Summary: We give algorithms for finding the \(k\) shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with \(n\) vertices and \(m\) edges, in time \(O(m+n\log n+k)\). We can also find the \(k\) shortest paths from a given source \(s\) to each
openaire +2 more sources
A new bidirectional algorithm for shortest paths [PDF]
For finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm.An A* instance requires a heuristic estimate, a real-valued function on the set of nodes.The version of bidirectional~A* that is considered the most ...
Pijls, W.H.L.M., Post, H.
core +1 more source
Leveraging shortest dependency paths in low-resource biomedical relation extraction
BMC Medical Informatics and Decision MakingBackground Biomedical Relation Extraction (RE) is essential for uncovering complex relationships between biomedical entities within text. However, training RE classifiers is challenging in low-resource biomedical applications with few labeled examples ...
Saman Enayati, Slobodan Vucetic
doaj +1 more source
Knapsack: Connectedness, Path, and Shortest-Path
Accepted in LATIN ...
Dey, Palash +2 more
openaire +2 more sources
A trainable clustering algorithm based on shortest paths from density peaks. [PDF]
Sci Adv, 2019 Pizzagalli DU, Gonzalez SF, Krause R.
europepmc +1 more source