GENERALIZATION OF DIJKSTRAâS ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN DIRECTED MULTIGRAPHS [PDF]
Journal of Computer Science, 2013 The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors generalize the classical Dijkstra’s algorithm to make it applicable to directed multigraphs. The modified algorithm is called by Generalized Dijkstra’s algorithm or GD Algorithm (GDA in short).
openaire +1 more source
An Effective Algorithm for Finding Shortest Paths in Tubular Spaces
Algorithms, 2022 We propose a novel algorithm to determine the Euclidean shortest path (ESP) from a given point (source) to another point (destination) inside a tubular space.
Dang-Viet-Anh Nguyen +2 more
doaj +1 more source
A REFINEMENT OF DIJKSTRAâS ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN GENERALIZED REAL TIME-MULTIGRAPHS [PDF]
Journal of Computer Science, 2014 The networks of the present day communication systems, be it a public road transportation system or a MANET or an Adhoc Network, frequently face a lot of uncertainties in particular regarding traffic jam, flood or water logging or PWD maintenance work (in case of public road network), attack or damage from inter nal or external agents, sudden failure ...
openaire +1 more source
International Journal of Applied Sciences and Smart Technologies, 2021 The Makassar City Fire Department often faces obstacles in handling fires. Problems that often hinder such as congestion at crossroads, panic residents, and others.
Melki Friaswanto +2 more
doaj +1 more source
Determining an optimal path for forest road construction using Dijkstra's algorithm
Journal of Forest Science, 2016 From an economic point of view a well-designed road path with the minimum construction cost is an optimal path that can be found using Dijkstra's algorithm.
A. Parsakhoo, M. Jajouzadeh
doaj +1 more source
Automatic and semi-automatic extraction of curvilinear features from SAR images [PDF]
, 2012 Extraction of curvilinear features from synthetic aperture radar (SAR) images is important for automatic recognition of various targets, such as fences, surrounding the buildings.
Akyılmaz, Emre +5 more
core +1 more source
Fast and efficient indoor navigation: a hybrid pathfinding approach using rapidly-exploring random tree (RRT)-connect and Dijkstra’s algorithm [PDF]
PeerJ Computer ScienceThis article introduces a hybrid approach to enhance indoor pathfinding and navigation within complex multistory environments by integrating rapidly-exploring random tree (RRT)-Connect and Dijkstra’s algorithm.
Ramamoorthy Sriramulu +2 more
doaj +2 more sources
Multiple Source Replacement Path Problem
, 2020 One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph $G$, $s$ and $t$, find shortest paths from $s$ to $t$ avoiding each edge $e$ on the shortest path from $s$ to $t$.
Bernstein Aaron +8 more
core +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
Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network [PDF]
, 2007 In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure channel model, the necessary and sufficient conditions defined in [2] for the ...
McEliece, Robert J., Soedarmadji, Edwin
core +1 more source