Results 91 to 100 of about 1,013,293 (288)
MathematicsThe shortest path problem is fundamental in graph theory and has been studied extensively due to its practical importance. Despite this aspect, finding the shortest path between two nodes remains a significant challenge in many applications, as it often ...
Adrien Durand +3 more
doaj +1 more source
Exploring the brachistochrone (shortest-time) path in fire spread
Scientific Reports, 2022 The brachistochrone (shortest-time) curve is the path connecting two points that enables the shortest travel time. This work explores the “brachistochrone path” of fire spread connecting two points at the same altitude and with a fixed path length.
Peiyi Sun, Yanhui Liu, Xinyan Huang
doaj +1 more source
Study on k-shortest paths with behavioral impedance domain from the intermodal public transportation system perspective [PDF]
, 2003 Behavioral impedance domain consists of a theory on route planning for pedestrians, within which constraint management is considered. The goal of this paper is to present the k-shortest path model using the behavioral impedance approach.
Lozada, Eleazar G. Madrid +2 more
core +1 more source
Finding shortest non-separating and non-disconnecting paths [PDF]
arXiv, 2022 For a connected graph $G = (V, E)$ and $s, t \in V$, a non-separating $s$-$t$ path is a path $P$ between $s$ and $t$ such that the set of vertices of $P$ does not separate $G$, that is, $G - V(P)$ is connected. An $s$-$t$ path is non-disconnecting if $G - E(P)$ is connected.
arxiv
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
The origin-destination shortest path problem [PDF]
, 1993 Includes bibliographical references (p. 34-35).Supported by the Air Force. AFOR-88-0088 Supported by the National Science Foundation. DDM-8921835 Supported by UPS.Muralidharan S.
core
Shortest Paths Avoiding Forbidden Subpaths [PDF]
Proceedings of the 26th International Symposium on Theoretical
Aspects of Computer Science (STACS), Freiburg, Germany, 2009, pp. 63-74, 2008 In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges.
arxiv
Lazy Shortest Path Computation In Dynamic Graphs
Computer Science, 2012 We address the problem of single-source shortest path computation in digraphs with non-negative edge weights subjected to frequent edge weight decreases such that only some shortest paths are requested in-between updates.
Daniel Aioanei
doaj +1 more source
Shortest Dubins Path to a Circle [PDF]
arXiv, 2018 The Dubins path problem had enormous applications in path planning for autonomous vehicles. In this paper, we consider a generalization of the Dubins path planning problem, which is to find a shortest Dubins path that starts from a given initial position and heading, and ends on a given target circle with the heading in the tangential direction.
arxiv
The two player shortest path network interdiction problem [PDF]
arXiv, 2020 In this article, we study a biobjective extension of the shortest path network interdiction problem. Each arc in the network is associated with two integer length values and two players compute their respective shortest paths from source to sink independently from each other while an interdictor tries to lengthen both shortest paths by removing arcs ...
arxiv