Results 1 to 10 of about 10,050 (224)
Implementation of the Floyd-Warshall Algorithm and Bellman-Ford Algorithm to Determine the Shortest Path in the Distribution of LPG Gas [PDF]
E3S Web of Conferences, 2023 In this article, the method use to determine the shortest path in the distribution of LPG is the Floyd-Warshall algorithm and the Bellman-Ford algorithm. These two methods will be compared to find out methods that can provide the best result.
Yusuf Moh. Rizky +3 more
doaj +2 more sources
Generalized blocked Floyd – Warshall algorithm
Журнал Белорусского государственного университета: Математика, информатика, 2019 One of the most commonly used on practice all-pairs shortest paths algorithms on weighted graphs is Floyd – Warshall algorithm. Blocked version serves as a basis for obtaining effective parallel algorithms to be implemented on multicore central ...
Nikolai A. Likhoded
doaj +3 more sources
Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train
IJID (International Journal on Informatics for Development), 2019 This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip. The best route is the path, which has the minimum price of a train journey.
Tri Setya Dermawan
doaj +2 more sources
Improved Floyd-Warshall Algorithm for Solving Travelling Salesman Problem
Jagannath University Journal of ScienceThe shortest path problem is a fundamental challenge in graph theory, focused on identifying the most efficient routes between nodes in a network. It stands as one of the extensively researched combinatorial optimization problems. In this paper, we explained the fundamental concepts of shortest path algorithms, with a particular emphasis on Floyd ...
Solima Khanam +2 more
openaire +2 more sources
Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time
Ars Mathematica Contemporanea, 2021 Summary: The paper describes two relatively simple modifications of the well-known Floyd-Warshall algorithm for computing all-pairs shortest paths. A fundamental difference of both modifications in comparison to the Floyd-Warshall algorithm is that the relaxation is done in a smart way.
Brodnik, Andrej +2 more
openaire +4 more sources
Modelling the Shortest Path for Inner Warehouse Travelling Using the Floyd–Warshall Algorithm
MathematicsOrder picking is referred as a critical process of selecting items requested by a customer in a warehouse. Meeting the demand of every customer is the main objective in this area.
Noraimi Azlin Mohd Nordin +3 more
doaj +2 more sources
ACD: An Adaptable Approach for RFID Cloning Attack Detection [PDF]
Sensors, 2020 With the rapid development of the internet of things, radio frequency identification (RFID) technology plays an important role in various fields. However, RFID systems are vulnerable to cloning attacks.
Weiqing Huang, Yanfang Zhang, Yue Feng
doaj +2 more sources
Cluster-Based Relocation of Stations for Efficient Forest Fire Management in the Province of Valencia (Spain) [PDF]
Sensors, 2021 Forest fires are undesirable situations with tremendous impacts on wildlife and people’s lives. Reaching them quickly is essential to slowing down their expansion and putting them out in an effective manner.
Miguel de Domingo +3 more
doaj +2 more sources
Designing futsal match finder application with floyd-warshall algorithm
Journal of Physics: Conference Series, 2019 Abstract Information about the locations where futsal competition is taking place is needed for the futsal team to meet each other and compete. The purpose of designing Futsal Match Finder is to determine the position of futsal field location and help the shortest path to the field by implementing Floyd-Warshall algorithm.
K Manaf +5 more
openaire +2 more sources
Floyd–Warshall Algorithm for Sparse Graphs
AlgorithmsThe Floyd–Warshall algorithm, which uses a classic dynamic programming approach, provides a solution to the all-pairs shortest paths problem. However, for sparse graphs, iteratively applying Dijkstra’s, or some other similar algorithm from each node ...
Dani Zugan, Rok Požar, Andrej Brodnik
doaj +2 more sources