Results 31 to 40 of about 383,776 (277)
When the path is never shortest: a reality check on shortest path biocomputation
, 2017 Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route ...
A Adamatzky +28 more
core +1 more source
The minimum energy expenditure shortest path method [PDF]
, 2014 This article discusses the addition of an energy parameter to the shortest path execution process; namely, the energy expenditure by a character during execution of the path.
Choset H. +14 more
core +1 more source
Shortest path embeddings of graphs on surfaces [PDF]
, 2016 The classical theorem of F\'{a}ry states that every planar graph can be represented by an embedding in which every edge is represented by a straight line segment.
de Mesmay, Arnaud +3 more
core +5 more sources
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
Developments in the theory of randomized shortest paths with a comparison of graph node distances [PDF]
, 2013 There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance.
Kivimäki, Ilkka +2 more
core +2 more sources
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
A Load Balancing Shortest Path Routing Algorithm for SRIO Network [PDF]
Jisuanji gongcheng, 2020 Routing selection algorithms are one of the important factors affecting transmission performance during serial RapidIO transmission.Aiming at the non-optimal allocation path of Serial Rapid Input and Output(SRIO) network depth search,this paper proposes ...
LI Jiawei, ZHANG Ji, ZHAO Juncai, DING Ruyi
doaj +1 more source
Generalized Shortest Path Kernel on Graphs
, 2015 We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes.
A Fronczak +6 more
core +1 more source
Stochastic Shortest Path Games [PDF]
SIAM Journal on Control and Optimization, 1999 Summary: We consider dynamic, two-player, zero-sum games where the ``minimizing'' player seeks to drive an underlying finite-state dynamic system to a special terminal state along a least expected cost path. The ``maximizer'' seeks to interfere with the minimizer's progress so as to maximize the expected total cost.
Patek, Stephen D., Bertsekas, Dimitri P.
openaire +1 more source
Reconfiguring Shortest Paths in Graphs
Algorithmica, 2022 AbstractReconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also shortest paths. This problem has several natural applications, namely: (a) repaving road networks, (b) rerouting data packets in a synchronous multiprocessing setting, (c) the ...
Gajjar, Kshitij +3 more
openaire +3 more sources