Results 161 to 170 of about 5,019,245 (200)
Some of the next articles are maybe not open access.
Solution of Shortest Paths in Non-Euclidean Farey Graph with Floyd-Warshall Algorithm
Süleyman Demirel Üniversitesi Fen-Edebiyat Fakültesi Fen DergisiAlgorithm applications on graphs are intensively researched. Graph theory systematizes complex and difficult problems and algorithms provide fast and clear solutions, which increases interest in the discipline. The Floyd-Warshall algorithm determines the
İbrahim Gökcan
semanticscholar +1 more source
Optimization of Rice Distribution Routes of Perum Bulog Medan Branch with Floyd-Warshall Algorithm
Journal of Mathematics Technology and EducationThe Floyd-Warshall algorithm is an algorithm that takes the minimum path from one point to another, which can be used to calculate the shortest path of a weighted graph.
Pasukat Sembiring, Astri Surbakti
semanticscholar +1 more source
Comparison of Floyd-Warshall Algorithm and Greedy Algorithm in Determining the Shortest Route
2018 2nd East Indonesia Conference on Computer and Information Technology (EIConCIT), 2018Prior to traveling, one of the most important things to pay attention to is to determine the travel route, especially the shortest path to be taken.
Huzain Azis +3 more
semanticscholar +1 more source
Derivation and Formal Proof of Floyd-Warshall Algorithm
International Conference Communication and Information Systems, 2021Graph algorithms are always complex and difficult to deduce and prove. In this paper, the Floyd-Warshall algorithm is deduced and formally proved. Firstly, the problem specification is described, and the loop invariant is detected and expressed by the ...
Z. Zuo +5 more
semanticscholar +1 more source
Optimizing Shortest Paths in Big Data Using the Floyd-Warshall Algorithm
International Conference on Contemporary ComputingImproving the efficacy and precision of route computations in massive datasets is the goal of optimizing big data shortest routes using the Floyd- Warshall algorithm.
D. P. Sangeetha +5 more
semanticscholar +1 more source
Jurnal Informatika dan Teknologi Komputer ( J-ICOM)
This research was conducted with the aim of finding out how to implement the shortest route using the Floyd-Warshall method and to analyze how much influence the implementation of the Floyd-Warshall method has on finding the closest route to the location
Resti Dhiafakri
semanticscholar +1 more source
This research was conducted with the aim of finding out how to implement the shortest route using the Floyd-Warshall method and to analyze how much influence the implementation of the Floyd-Warshall method has on finding the closest route to the location
Resti Dhiafakri
semanticscholar +1 more source
Hidden Circle Power Flow Detection Using the Floyd-Warshall Algorithm
IEEE PES Innovative Smart Grid Technologies Conference EuropeFlexible AC Transmission Systems (FACTS) enable power grid operators to regulate power flows more effectively. However, inadequate control of voltage magnitude and phase angle can lead to unintended consequences.
Teng Jiang +2 more
semanticscholar +1 more source
Improved Computing Performance for Floyd-Warshall Algorithm in the MapReduce architectures
International Scientific Journal of ComputingThe main result of this paper is building a new parallel algorithm based on Floyd-Warshall algorithm to find the Shortest Path for all-pair. The problem of finding All Pair Shortest Path (APSP).
Nguyen Dinh Lau, Lê Thanh Tuấn
semanticscholar +1 more source
2024 8th International Conference on Electronics, Communication and Aerospace Technology (ICECA)
The Floyd-Warshall algorithm is a widely utilized graph-based technique designed to address the all-pairs shortest path problem. However, its cubic time complexity $O\left(n^{3}\right)$ creates performance bottlenecks when applied to large graphs ...
Sanjay Kumar +3 more
semanticscholar +1 more source
The Floyd-Warshall algorithm is a widely utilized graph-based technique designed to address the all-pairs shortest path problem. However, its cubic time complexity $O\left(n^{3}\right)$ creates performance bottlenecks when applied to large graphs ...
Sanjay Kumar +3 more
semanticscholar +1 more source
Apllication of Optimization Heavy Traffic Path with Floyd-Warshall Algorithm
2018 International Conference on Control, Electronics, Renewable Energy and Communications (ICCEREC), 2018Congestion in a region can cause a lack of efficiency of resources used and can have a wide impact on the smoothness of socio-economic activities in the region one of them in the area of Bandung and especially in the field of tourism congestion caused ...
Kadek Laga +3 more
semanticscholar +1 more source