Results 21 to 30 of about 218,626 (238)
Finding $k$ Simple Shortest Paths and Cycles [PDF]
, 2016 The problem of finding multiple simple shortest paths in a weighted directed graph $G=(V,E)$ has many applications, and is considerably more difficult than the corresponding problem when cycles are allowed in the paths. Even for a single source-sink pair,
Agarwal, Udit, Ramachandran, Vijaya
core +2 more sources
Shortest Paths Avoiding Forbidden Subpaths [PDF]
, 2009 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.
Ahmed, Mustaq, Lubiw, Anna
core +6 more sources
Rerouting shortest paths in planar graphs [PDF]
, 2012 A rerouting sequence is a sequence of shortest st-paths such that consecutive paths differ in one vertex. We study the the Shortest Path Rerouting Problem, which asks, given two shortest st-paths P and Q in a graph G, whether a rerouting sequence exists ...
Bonsma, Paul
core +3 more sources
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Darmann +2 more
openaire +1 more source
Shortest shortest path trees of a network
Discrete Applied Mathematics, 1996 If \(N\) is an undirected network where each edge has positive length, we may consider the distances of vertices from a specified internal point of an edge. A shortest path tree (SPT) rooted at \(s\) (possibly an internal point of an edge) is a spanning tree \(T\) of the network \(N[s]\) (i.e., \(N\) with \(s\) as possibly a new vertex) where for each ...
Pierre Hansen, Maolin Zheng
openaire +1 more source
Shortest Paths in HSI Space for Color Texture Classification [PDF]
, 2018 Color texture representation is an important step in the task of texture classification. Shortest paths was used to extract color texture features from RGB and HSV color spaces.
A Drimbarean +22 more
core +2 more sources
Parametric shortest-path algorithms via tropical geometry
, 2021 We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry.
Joswig, Michael, Schröter, Benjamin
core +1 more source
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 +1 more source
Finding an induced path that is not a shortest path [PDF]
Discrete Mathematics, 2021 We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.
Eli Berger +2 more
openaire +3 more sources
Approximate Euclidean shortest paths in polygonal domains [PDF]
, 2019 Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input parameter ...
Inkulu, R, Kapoor, Sanjiv
core +2 more sources