Results 51 to 60 of about 569,188 (376)
Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph [PDF]
Neutrosophic Sets and Systems, 2019 One of the important non-linear data structures in Computer Science is graph. Most of the real life network, be it a road transportation network, or airlines network or a communication network etc., cannot be exactly transformed into a graph model, but ...
Siddhartha Sankar Biswas
doaj +1 more source
Special cases of the quadratic shortest path problem [PDF]
Journal of combinatorial optimization, 2016 The quadratic shortest path problem (QSPP) is the problem of finding a path with prespecified start vertex s and end vertex t in a digraph such that the sum of weights of arcs and the sum of interaction costs over all pairs of arcs on the path is ...
Hao Hu, R. Sotirov
semanticscholar +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
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
Faster Replacement Paths [PDF]
, 2010 The replacement paths problem for directed graphs is to find for given nodes s and t and every edge e on the shortest path between them, the shortest path between s and t which avoids e.
Williams, Virginia Vassilevska
core +2 more sources
A lower bound for the shortest path problem [PDF]
Proceedings 15th Annual IEEE Conference on Computational Complexity, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MULMULEY, K, SHAH, P
openaire +2 more sources
An Algorithm for the Cycled Shortest Path Problem [PDF]
Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2011 For a network with cycle, where at least one cycle exists, the Floyd- Warshall algorithm is probably the most used algorithm to determine he least cost path between every pair of nodes on this network, i.e. the solution for the shortest path problem with
Asghar Aini, Amir Salehipour
doaj
Applying Dijkstra algorithm for solving neutrosophic shortest path problem
International Conference on Advanced Mechatronic Systems, 2016 The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem
S. Broumi +4 more
semanticscholar +1 more source
The Rough Interval Shortest Path Problem
, 2021 The shortest path problem is one of the most popular network optimization problems and it is of great importance in areas such as transportation, network design or telecommunications. This model deals with determining a minimum weighted path between a pair of nodes of a given network.
Moghanni A., Pascoal M.
openaire +3 more sources
A Hybrid Routing Approach Using Two Searching Layers
Electrical, Control and Communication Engineering, 2021 This paper considers SUB_GOALs by using basic A* algorithm and Subgoal Graphs in a hybrid approach to execute optimal route. SUB_GOALs identified with pre-searching from basic A* at break points and Subgoal Graphs at corners of obstacles are added to ...
Koca Gonca Ozmen, Yetkin Seda
doaj +1 more source