Relevant bibliographies by topics / Bellman-Ford algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Bellman-Ford algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Bellman-Ford algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Bellman-Ford algorithm"

1

Afivah and Meira Perma Dewi. "Bellman-Ford Algorithm for Shortest Path Selection." Rangkiang Mathematics Journal 4, no. 1 (2025): 1–5. https://doi.org/10.24036/rmj.v4i1.65.

Full text
Abstract:
Determining the shortest path from one point to another (destination) is a problem often encountered in life. With the development of science and technology, the problem of finding the shortest path can be solved using various algorithms. The algorithm that is often used to find the shortest route is the Bellman-Ford algorithm. The Bellman-Ford algorithm requires initial location parameters and a destination as input to determine the shortest path. The algorithm's results provide the shortest distance along with the route from the initial location to the destination. Applying the Bellman-Ford
APA, Harvard, Vancouver, ISO, and other styles
2

Saxena, Mohit Chandra, Munish Sabharwal, and Preeti Bajaj. "An Optimised Shortest Path Algorithm for Network Rotuting & SDN." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 8s (2023): 20–31. http://dx.doi.org/10.17762/ijritcc.v11i8s.7172.

Full text
Abstract:
Network routing algorithms form the backbone of data transmission in modern network architectures, with implications for efficiency, speed, and reliability. This research aims to critically investigate and compare three prominent routing algorithms: Bellman-Ford, Shortest Path Faster Algorithm (SPFA), and our novel improved variant of Bellman-Ford, the Space-efficient Cost-Balancing Bellman-Ford (SCBF). We evaluate the performance of these algorithms in terms of time and space complexity, memory utilization, and routing efficacy, within a simulated network environment. Our results indicate tha
APA, Harvard, Vancouver, ISO, and other styles
3

Prasetyo Wibowo Yunanto. "Modification of Shortest Path Algorithm for Ambulance in Various Road Conditions for Emergency Patients." Journal of Information Systems Engineering and Management 10, no. 28s (2025): 19–31. https://doi.org/10.52783/jisem.v10i28s.4301.

Full text
Abstract:
Road conditions and quality can significantly affect ambulance arrival time. Arrival time can be optimized by choosing the shortest route free from potential congestion. Patient safety during the journey is an essential factor that must be considered. Poor road conditions are one of the factors that can affect patient safety. This study aims to provide ambulance navigation by choosing the shortest safe route for emergency patients in various road conditions. The simulation of finding the shortest route using the modified A* algorithm and the Bellman-Ford algorithm to avoid routes with specific
APA, Harvard, Vancouver, ISO, and other styles
4

Dinitz, Yefim, and Rotem Itzhak. "Hybrid Bellman–Ford–Dijkstra algorithm." Journal of Discrete Algorithms 42 (January 2017): 35–44. http://dx.doi.org/10.1016/j.jda.2017.01.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rai, Avinish. "A Study on Bellman Ford Algorithm for Shortest Path Detection in Global Positioning System." International Journal for Research in Applied Science and Engineering Technology 10, no. 5 (2022): 2118–26. http://dx.doi.org/10.22214/ijraset.2022.42720.

Full text
Abstract:
Abstract: This is the Master of Technology project report of Mr. Avinish Rai (Roll No- MT/CS/45001/20), final year student in the department of Computer Science and Engineering, Birla Institute of Technology, under the supervision and guidance of Dr Ila Sahay Dayal. The thesis deals with Bellman ford algorithms is used to find the optimal shortest path between two or more than two nodes in the graph or in the tree. In this paper we add this bellman ford functionality in the G.P.S. this algorithm will work as the parameter in this and use from the initial node to target or source node. We will
APA, Harvard, Vancouver, ISO, and other styles
6

Motghare, Preshit, Gaurav Ulekar, Sudarshan Biradar, and Prof Dipti Pandit. "Hybrid Algorithm Combining Bellman-Ford, Dijkstra, and Machine Learning for Dynamic Network Routing." International Journal for Research in Applied Science and Engineering Technology 12, no. 11 (2024): 2368–77. https://doi.org/10.22214/ijraset.2024.65581.

Full text
Abstract:
Abstract: Optimizing routing in dynamic networks has emerged as an increasingly important problem today with re- duced latency, guaranteed connectivity and efficient data trans- fer under a variety of changing conditions. Among the more well known shortest path algorithms those of Bellman-Ford and Dijkstra’s have very notable advantages and disadvantages themselves; while Bellman-Ford has provisions against negative weighted edges and pays a penalty in computation, Dijkstra’s algorithm cannot work with negative weighted edges but is highly efficient. It introduces a new hybrid routing algorith
APA, Harvard, Vancouver, ISO, and other styles
7

Cholla, Dr Raman. "Optimizing the Bellman-Ford Algorithm Using GPU Parallelization." INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 09, no. 05 (2025): 1–9. https://doi.org/10.55041/ijsrem47660.

Full text
Abstract:
ABSTRACT The Bellman-Ford algorithm's temporal complexity of O(VE) renders it ineffective for big and dense networks, which is a serious computational disadvantage. The need for effective algorithms that can handle large-scale graph structures has increased due to the modern digital landscape's rapid data expansion. The Single Source Shortest Path (SSSP) problem, which entails determining the shortest pathways from a single source vertex to every other vertex in a graph, is one of the most basic and extensively researched topics in graph theory. Numerous real-world applications, including biol
APA, Harvard, Vancouver, ISO, and other styles
8

Yaddarabullah, Yaddarabullah. "Modifikasi Algoritme Bellman-Ford Untuk Pencarian Rute Terpendek Berdasarkan Kondisi Jalan." Jurnal Teknologi dan Sistem Komputer 7, no. 3 (2019): 109–15. http://dx.doi.org/10.14710/jtsiskom.7.3.2019.109-115.

Full text
Abstract:
The application of the Bellman-ford algorithm for finding the shortest path both weighted and unweighted graph has a weakness in determining the shortest path based on road conditions. This study modified the Bellman-Ford algorithm by adding the Technique for Order of Preference by Similarity to the Ideal Solution method to provide alternative road assessments based on its condition criteria including road density, road width, travel time, and distance. This modified Bellman-Ford has better performance in finding the alternative shortest path by choosing a road with smoother conditions, even t
APA, Harvard, Vancouver, ISO, and other styles
9

Yusuf, Moh Rizky, Nurwan Nurwan, Djihad Wungguli, and Lailany Yahya. "Implementation of the Floyd-Warshall Algorithm and Bellman-Ford Algorithm to Determine the Shortest Path in the Distribution of LPG Gas." E3S Web of Conferences 400 (2023): 03004. http://dx.doi.org/10.1051/e3sconf/202340003004.

Full text
Abstract:
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. The best result is the path that has the minimum distance of distribution of LPG. Both of these algorithms are focused on simulating calculations that begin by representing the map in the form of a graph. Finally, the results obtained from this study are that using the Floyd-Warshall algorithm produces a path with a total distance of 111.05 KM while the B
APA, Harvard, Vancouver, ISO, and other styles
10

Ghimire, Roshani, and Ram Kumar Basnet. "Shortest Path Routing Performance Evaluation over SDN Environment." December 2023 5, no. 4 (2023): 405–22. http://dx.doi.org/10.36548/jei.2023.4.004.

Full text
Abstract:
Static routing has a manual configuration setup system, and the scope of static routing in an SDN network is just for small networks. The solution to this problem rises up with the new technology defined as software-defined networking (SDN) based on shortest path first dynamic routing. SDN has the facility of a centralized controller that smooth the controls and routes computation over a data packet. The performance analysis of SDN networks that have SDN switches connected to the network based on the shortest path first protocol are simulated on Mininet. The POX controller with Mininet programming
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Bellman-Ford algorithm"

1

Yarmolskyy, Oleksandr. "Využití distribuovaných a stochastických algoritmů v síti." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2018. http://www.nusl.cz/ntk/nusl-370918.

Full text
Abstract:
This thesis deals with the distributed and stochastic algorithms including testing their convergence in networks. The theoretical part briefly describes above mentioned algorithms, including their division, problems, advantages and disadvantages. Furthermore, two distributed algorithms and two stochastic algorithms are chosen. The practical part is done by comparing the speed of convergence on various network topologies in Matlab.
APA, Harvard, Vancouver, ISO, and other styles
2

Chevalier, Jérémie. "Optimisation des routes de départ et d'arrivée aux approches des grands aéroports." Thesis, Toulouse 3, 2020. http://www.theses.fr/2020TOU30092.

Full text
Abstract:
Les TMAs (Terminal Maneuvering Areas) sont aujourd'hui un goulot d'étranglement de l'espace aérien, dans lequel les avions quittent leur phase de croisière pour atterrir à un aéroport, ou au contraire effectuent leur montée pour rejoindre leur route de croisière. Afin d'éviter la congestion de ces zones, il est nécessaire de construire des routes de départ et d'arrivée efficaces. Dans ce travail, une solution pour la création de routes de départ et d'arrivée est proposée, prenant en compte la configuration des pistes, les environs de l'aéroport, ainsi qu'un ensemble de contraintes opérationnel
APA, Harvard, Vancouver, ISO, and other styles
3

Бережная, Ольга Владимировна, Ольга Володимирівна Бережна, Olha Volodymyrivna Berezhna та А. В. Сливченко. "Сравнительный анализ алгоритмов Беллмана-Форда и алгоритма Дейкстры". Thesis, Видавництво СумДУ, 2010. http://essuir.sumdu.edu.ua/handle/123456789/4008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Stráník, František. "Teorie grafů - implementace vybraných problémů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218082.

Full text
Abstract:
This work is intended on identification with basic problems from the graphs theory area. There are the basic conceptions as well more complicated problems described. The one part of this work is specialized in working of individual types of graphs. It starts with single linked list through double linked list after as much as trees which represented the simplest graphs textures. The other part of this work devotes to the whole graph and describes more complicated problems and their resolution from the theory graphs area. Among these problems belongs to searching in graphs help by Depth First Se
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Bellman-Ford algorithm"

1

Broumi, Said, Mohamed Talea, Assia Bakali, Florentin Smarandache, and Santanu Kumar Patro. "On the Neutrosophic Counterpart of Bellman-Ford Algorithm." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-36677-3_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cavendish, D., and M. Gerla. "Internet QoS Routing using the Bellman-Ford Algorithm." In High Performance Networking. Springer US, 1998. http://dx.doi.org/10.1007/978-0-387-35388-3_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jeong, In-Kyu, Jia Uddin, Myeongsu Kang, Cheol-Hong Kim, and Jong-Myon Kim. "Accelerating a Bellman–Ford Routing Algorithm Using GPU." In Lecture Notes in Electrical Engineering. Springer Netherlands, 2014. http://dx.doi.org/10.1007/978-94-017-8798-7_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Safari, Mohsen, Wytse Oortwijn, and Marieke Huisman. "Automated Verification of the Parallel Bellman–Ford Algorithm." In Static Analysis. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-88806-0_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Broumi, Said, Deivanayagampillai Nagarajan, Malayalan Lathamaheswari, Mohamed Talea, Assia Bakali, and Florentin Smarandache. "Bellman-Ford Algorithm Under Trapezoidal Interval Valued Neutrosophic Environment." In Communications in Computer and Information Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36368-0_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Neha and Akhil Kaushik. "Extended Bellman Ford Algorithm with Optimized Time of Computation." In Advances in Intelligent Systems and Computing. Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-0135-2_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Devi Boddu, Rama, K. Kishan Rao, and M. Asha Rani. "Performance Analysis of Modified Bellman Ford Algorithm Using Cooperative Relays." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-13731-5_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vezolainen, Alexei, Alexey Salnikov, Artem Klyuchikov, and Sergey Komech. "Fast Parallel Bellman-Ford-Moore Algorithm Implementation for Small Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-22941-1_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wungguli, Djihad, Hendra Gemu, Nurwan Nurwan, and Hasan S. Panigoro. "An Application of Bellman-Ford Algorithm on The Ambulance Routing." In Advances in Social Science, Education and Humanities Research. Atlantis Press SARL, 2025. https://doi.org/10.2991/978-2-38476-410-5_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Vezolainen, Alexei, Alexey Salnikov, Artem Klyuchikov, and Sergey Komech. "Correction to: Fast Parallel Bellman-Ford-Moore Algorithm Implementation for Small Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-22941-1_51.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bellman-Ford algorithm"

1

Karthikeyan, M., Satheeshkumar Sekar, H. Anwer Basha, P. Epsiba, E. N. Ganesh, and B. Meenakshi. "Dijkstra’s Algorithm with Bellman-Ford for Shortest Path Discovery in Big Data." In 2024 2nd International Conference on Self Sustainable Artificial Intelligence Systems (ICSSAS). IEEE, 2024. https://doi.org/10.1109/icssas64001.2024.10760521.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tammanashastri, Prabhav Ravi, Shinu M. Rajagopal, and Sahen Shivadutt Bananjee. "Comparative Analysis of Bellman-Ford and Dijkstra Algorithms in Software Defined Networking." In 2024 5th International Conference on Data Intelligence and Cognitive Informatics (ICDICI). IEEE, 2024. https://doi.org/10.1109/icdici62993.2024.10810921.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Nair, Rekha R., Tina Babu, Gayathri Ramasamy, et al. "Optimized Nearest Store allocation using Dijkstra’s and Bellman-Ford Algorithms for Enhanced Retail Efficiency." In 2024 International BIT Conference (BITCON). IEEE, 2024. https://doi.org/10.1109/bitcon63716.2024.10985539.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Wei, Hao Chen, Chong Jiang, and Lin Zhu. "Improvement And Experimental Evaluation Bellman-Ford Algorithm." In 2013 International Conference on Advanced ICT. Atlantis Press, 2013. http://dx.doi.org/10.2991/icaicte.2013.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bannister, Michael J., and David Eppstein. "Randomized Speedup of the Bellman–Ford Algorithm." In 2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Society for Industrial and Applied Mathematics, 2012. http://dx.doi.org/10.1137/1.9781611973020.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ekpanyapong, Mongkol, Thaisiri Waterwai, and Sung Kyu Lim. "Statistical Bellman-Ford algorithm with an application to retiming." In the 2006 conference. ACM Press, 2006. http://dx.doi.org/10.1145/1118299.1118514.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Surve, Ganesh G., and Medha A. Shah. "Parallel implementation of Bellman-ford algorithm using CUDA architecture." In 2017 International Conference of Electronics, Communication and Aerospace Technology (ICECA). IEEE, 2017. http://dx.doi.org/10.1109/iceca.2017.8212794.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Nazarifard, Marjan, and Davoud Bahrepour. "Efficient implementation of the Bellman-Ford algorithm on GPU." In 2017 IEEE 4th International Conference on Knowledge-Based Engineering and Innovation (KBEI). IEEE, 2017. http://dx.doi.org/10.1109/kbei.2017.8324901.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ferik, Brahim, Lakhdar Laimeche, Abdallah Meraoumia, Abdelkader Laouid, Muath Alshaikh, and Khaled Chait. "An Adaptive Image Watermarking based on Bellman-Ford Algorithm." In ICFNDS '23: The International Conference on Future Networks and Distributed Systems. ACM, 2023. http://dx.doi.org/10.1145/3644713.3644762.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Faychuk, Valentyn, Orest Lavriv, Mykhailo Klymash, Viktoriia Zhebka, and Olga Shpur. "Investigation of the Bellman-Ford Algorithm Enhanced for Remote Execution." In 2019 3rd International Conference on Advanced Information and Communications Technologies (AICT). IEEE, 2019. http://dx.doi.org/10.1109/aiact.2019.8847727.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bellman-Ford algorithm' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography