Results 21 to 30 of about 371,797 (314)
PLoS ONE, 2022 In this article, a new path planning algorithm is proposed. The algorithm is developed on the basis of the algorithm for finding the best value using multi-objective evolutionary particle swarm optimization, known as the MOEPSO. The proposed algorithm is
Ittikon Thammachantuek, Mahasak Ketcham
doaj +1 more source
Shortest Paths in Multiplex Networks [PDF]
Scientific Reports, 2017 AbstractThe shortest path problem is one of the most fundamental networks optimization problems. Nowadays, individuals interact in extraordinarily numerous ways through their offline and online life (e.g., co-authorship, co-workership, or retweet relation in Twitter). These interactions have two key features.
Saeed Ghariblou +3 more
openaire +5 more sources
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
Shortest Paths between Shortest Paths and Independent Sets [PDF]
, 2011 We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length.
Kaminski, Marcin +2 more
openaire +3 more sources
Shortest paths between shortest paths
Theoretical Computer Science, 2011 AbstractWe study the following problem on reconfiguring shortest paths in graphs: Given two shortest s–t paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s–t path and must differ from the previous one by only one vertex.
Kaminski, Marcin +2 more
openaire +2 more sources
The shortest cut in brane cosmology [PDF]
, 2001 We consider brane cosmology studying the shortest null path on the brane for photons, and in the bulk for gravitons. We derive the differential equation for the shortest path in the bulk for a 1+4 cosmological metric.
A. Davis +29 more
core +3 more sources
Random assignment and shortest path problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by
Johan Wästlund
doaj +1 more source
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
Shortest path poset of Bruhat intervals [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Let $[u,v]$ be a Bruhat interval and $B(u,v)$ be its corresponding Bruhat graph. The combinatorial and topological structure of the longest $u-v$ paths of $B(u,v)$ has been extensively studied and is well-known.
Saúl A. Blanco
doaj +1 more source
A machine learning approach for predicting human shortest path task performance
Visual Informatics, 2022 Finding a shortest path for a given pair of vertices in a graph drawing is one of the fundamental tasks for qualitative evaluation of graph drawings.
Shijun Cai +4 more
doaj