shortest path graph-search
Download Download PDF
... solve shortest path problems viz: Label-setting algorithm (LSA) [14 - 16], and Label-correcting algorithm (LCA) such as [17 - 19] graph growth algorithms with two queues (TWO-Q) data structures and ...
13
Bidirectional Graph Search Techniques for Finding Shortest Path in Image based Maze Problem
... of shortest path length, however, this can be achieved by modifying the algorithm to repeat the procedure further until the path length of a pre specified length is found which can be different ...
5
Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm
... The game map needs to be well prepared or pre-processed before the A* algorithm can work. The game environment will be handled as a graph [3]. This involves breaking the map into different points or locations, ...
12
An Efficient Algorithm for Finding Top-K Shortest Simple Path
... Finding shortest simple paths in a directed graph is a fundamental problem in many engineering ...k shortest paths in a directed graph, plays an important role in many application domains, ...
6
Optimizing Cost-Effective Travel Modes between Two Destinations Using Dijkstra Approach
... Dijkstra algorithm is one of the classical algorithms in SPP, specialized in single-source shortest path problem in a directed graph with nonnegative weight. Dijkstra is a simpler and faster version ...
6
Network Routing Protocol using Genetic Algorithms
... a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree ...the ...
5
1. Shortest-path: dynamic and extensible indicator for geographical search on road networks
... The Dijkstra’s algorithm is used to calculate and estimate the optimal path between two interceding points on a network using a connected graph that is made up of nodes and edges. It assigns a cost value to ...
7
GRAPH PATTERN MATCHING IN YEAST DATASET
... Finding shortest paths in graph based domains is demanding issue especially in recent digital ...applying graph algorithms. The huge number of graph nodes and links makes the existing ...
10
High performance graph analysis on parallel architectures
... breadth-first search systematically explores the edges of G to discover every vertex that is reachable from ...many graph algorithms as finding maximum-flow/minimum-cut [159] and detecting community ...
153
OPTIMAL SOLUTION FOR SHORTEST PATH PROBLEM USING HEURISTIC SEARCH TECHNIQUE
... heuristic search algorithms like hill climbing, A*, AO*, and simulated ...partial graph one state at a time and re- computing the best policy over the graph after each ...heuristic search ...
10
The electric vehicle routing problem with backhauls Pages 131-152 Download PDF
... local search (ILS) algorithm is used as an initialization methodology, whose main characteristic is to apply inter-route and intra-route movements to explore the search space generated by the solution ...
22
Text Alignment for Real Time Crowd Captioning
... domly extracted one-minute long audio clips from four MIT OpenCourseWare lectures. Each clip was transcribed by 7 human workers, and then aligned and combined using four different systems: the graph-based system, ...
10
A Novel Approach for finding a Shortest Path Problem with Intuitionistic Fuzzy Network
... This paper organized as follows: In section 2 some basic concepts on Intuitionistic fuzzy set theory have been introduced .Section 3 includes the modified algorithm for finding shortest path from source ...
8
Graph Model for Chinese Spell Checking
... A graph model is used to represent the sentence and a single source shortest path (SSSP) algo- rithm is performed on the graph to correct spell ...
5
Solving shortest path problem using gravitational search algorithm and neural networks
... Gravitational Search Algorithm that is used in this study, is a new algorithm proposed by Rashedi in 2008, and is an attempt to establish a new population-based search algorithm based on gravity ...
19
A Generic C++ Library for Solving Path Problems
... Efficiency of the implemented algorithms is generally inferior to specialized algorithms used for solving particular path problems due to dif- ferences in their time complexities. Neverthe- less, the intention of ...
7
Randomized shortest paths and their applications
... In (Saerens et al., 2009), instead of fixing the local entropy defined at each node as in (Achbany et al., 2006, 2008), the global entropy spread over the whole network is fixed. While this difference seems a priori ...
218
Improved Force Directed Layout Algorithm for Social Network Visualization
... Data in social networks is not only complex, but also huge. In order to globally display large-scale social networks, Literature [6] adopted parallelization techniques and layered ideas. The existing community discovery ...
6
A New Approach in Computing Shortest Path for Road Networks
... We have several online services providers like Google- Map [4], Navteq [5], INRIX Information Provider [6], TomTom NV [7], etc which provides use with the route maps for a selected source and destinations. An image taken ...
5
An Extension of the Paper “Maximum Distance in Graphs”
... Thamarai Selvi and Vaidyanathan [1] introduced the concept of Maximum distance (M – distance) in a graph. They claimed a few relations between the (usual) metric distance and M – distance related to a ...
7