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: 30 May 2022

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

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
2

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 (May 31, 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 do the comparative and mathematical studies between both Dijkstra’s and Bellman ford algorithm which will give optimal results.
APA, Harvard, Vancouver, ISO, and other styles
3

Yaddarabullah, Yaddarabullah. "Modifikasi Algoritme Bellman-Ford Untuk Pencarian Rute Terpendek Berdasarkan Kondisi Jalan." Jurnal Teknologi dan Sistem Komputer 7, no. 3 (July 31, 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 though distance and travel time increase.
APA, Harvard, Vancouver, ISO, and other styles
4

Jadhav, Lekha, Rahul Dubey, and Manish Shrivastava. "Cache Friendly Bellman-Ford algorithm using OpenCL." International Journal of Computer Applications 139, no. 13 (April 15, 2016): 1–3. http://dx.doi.org/10.5120/ijca2016909305.

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

Pramudita, Rully, and Nadya Safitri. "Algoritma Bellman-Ford Untuk Menentukan Jalur Tercepat Dalam Sistem Informasi Geografis." PIKSEL : Penelitian Ilmu Komputer Sistem Embedded and Logic 6, no. 2 (September 18, 2018): 105–14. http://dx.doi.org/10.33558/piksel.v6i2.1502.

Full text
Abstract:
Abstract In a large city, there are many congestion problems, so the selection of the fastest route to reach the destination is needed. The city of Bandung is one of the big cities in Indonesia which has a fairly crowded traffic density and tends to be a lot of congestion in it. So we need a study that can discuss the path of independence. In the study to determine the shortest path there are several algorithm options to solve it. This research was conducted using the Bellman Ford algorithm to try to solve the problem of selecting the fastest path. The case that will be focused on in this study covers the route that starts from Ir. H. Juanda street and ends at the Leuwipanjang bus terminal. The road node that will be passed is taken from several main points that will be passed. Calculation of coordinates will be calculated using the concept of graph and haversine formula. The impact of this research is that it can be known the fastest path needed using the Bellman Ford algorithm. Keywords: Algoritm, Bellman Ford, Graph, Haversine Formula, Shortest Path. Abstrak Dalam sebuah kota besar saat ini banyak sekali permasalahan kemacetan, maka dibutuhkan pemilihan rute jalan yang tercepat untuk mencapai tujuan. Kota Bandung merupakan salah satu kota besar di Indonesia yang memiliki kepadatan lalu lintas cukup ramai dan cenderung banyak terjadi kemacetan didalamnya. Maka diperlukan sebuah penelitian yang dapat membahas mengenai jalur tependek. Dalam kajian untuk menentukan jalur terpendek terdapat beberapa pilihan algoritma untuk menyelesaikannya. Penelitian ini dilakukan menggunakan algoritma Bellman Ford untuk mencoba menyelesaikan masalah pemilihan jalur tercepat. Kasus yang akan difokuskan dalam penelitian ini mencangkup rute yang dimulai dari jalan Ir.H.Djuanda dan berakhir di terminal bis Leuwipanjang. Simpul jalan yang akan dilalui diambil dari beberapa titik utama yang akan dapat dilewati. Perhitungan koordinat akan dihitung menggunakan konsep graf dan haversine formula. Dampak dari penelitian ini yaitu dapat diketahuinya jalur tercepat yang dibutuhkan menggunakan algoritma Bellman Ford. Kata kunci: Algoritma, Bellman Ford, Graf, Haversine Formula, Shortest Path.
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Dandan, and Panjing Tan. "Internet of Things and Intelligent Transportation System." Journal of Physics: Conference Series 2066, no. 1 (November 1, 2021): 012066. http://dx.doi.org/10.1088/1742-6596/2066/1/012066.

Full text
Abstract:
Abstract As the core of the new monitoring system, the Internet of Things realizes the integration of wireless sensor networks and traditional communication networks, and provides a platform for remote management and monitoring of the underlying equipment. The intelligent transportation system framework built on this basis combines intelligent transportation technology and the organic combination of vehicle management technologies is conducive to the safety, speed and reliability of vehicle transportation, and plays an important role in further reducing transportation costs. Based on this, this article launched the research on the Internet of Things and intelligent transportation systems. This article first summarizes the concepts of the Internet of Things, intelligent transportation and wireless sensor network technology and the current research status at home and abroad. By analyzing and comparing the performance and characteristics of various communication methods, embedded core microprocessors and embedded operating systems, this paper proposes an overall design scheme of the Internet of Things transportation system based on embedded technology. This paper analyzes the path planning problems in the application of the transportation system, combining the shortest path algorithm simulation results and the actual characteristics of the transportation network, and proposes a simulation data fitting method based on two network parameters and Bellman-Ford, Dijkstra, and Floyd algorithms. The route optimization scheme, and the above-mentioned design scheme was implemented in the transportation system, and the scheme verification was carried out. Finally, this article describes in detail the overall debugging process and operating results of the transportation system, thereby fully verifying the feasibility and correctness of the design and implementation methods of the intelligent transportation system based on the Internet of Things. The research results show that when the INF-PROPORTION is small, the Dijkstra algorithm is better than the Bellman-Ford algorithm. When INF-PROPORTION=0.3, the two algorithms T overlap. Since then, the advantages of the Bellman-Ford algorithm gradually appear, but it is approaching in INF-PROPORTION. At 1 o’clock, the Dijkstra algorithm has a sharp decrease, which is again smaller than the Bellman-Ford algorithm. The second loop condition in the main loop of Dijkstra’s algorithm cannot be satisfied, resulting in a decrease in T.
APA, Harvard, Vancouver, ISO, and other styles
7

Sulaiman, Oris Krianto, Amir Mahmud Siregar, Khairuddin Nasution, and Tasliyah Haramaini. "Bellman Ford algorithm - in Routing Information Protocol (RIP)." Journal of Physics: Conference Series 1007 (April 2018): 012009. http://dx.doi.org/10.1088/1742-6596/1007/1/012009.

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

Lam, K. P., and C. W. Tong. "Optimisation circuits for the Bellman-Ford computation algorithm." Electronics Letters 30, no. 19 (September 15, 1994): 1584–86. http://dx.doi.org/10.1049/el:19941077.

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

Goldberg, Andrew V., and Tomasz Radzik. "A heuristic improvement of the Bellman-Ford algorithm." Applied Mathematics Letters 6, no. 3 (May 1993): 3–6. http://dx.doi.org/10.1016/0893-9659(93)90022-f.

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

Kumar Rao, Kavikondala Praveen, and Tamilarasan Senthil Murugan. "An Efficient Routing Algorithm for Software Defined Networking using Bellman Ford Algorithm." International Journal of Online and Biomedical Engineering (iJOE) 15, no. 14 (October 26, 2019): 87. http://dx.doi.org/10.3991/ijoe.v15i14.11546.

Full text
Abstract:
<p class="0abstract">Software-Defined Networking (SDN) is the developing technology and has the advantages of handling dynamic nodes in the network with improved performance. SDN has the problem of allocating the resources to the user with high latency and this affects the overall system performance. To solve this problem, the routing method based on Bellman Ford Algorithm (BFA) is proposed in the SDN. The Bellman-Ford has less computation time in identifying the shortest path in the nodes of SDN graph. The BFA is applied to identify the optimal path for the nodes to the user with low latency. The BFA is compared with Dijikstra’s algorithm to analyze its performance. The experimental outcome shows that the BFA has lower latency compared to the Dijkstra's algorithm. The lower computation time is achieved due to BFA has a lower magnitude time in vertices and edges compared Dijkstra's algorithm. The Dijkstra’s algorithm has the latency of 10.8 ms, while proposed BFA has the latency of 2.97ms.</p>
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érationnelles telles que les angles de montée ou de virages limités. Les routes sont en deux parties : un chemin horizontal construit dans un graphe discrétisant la TMA, auquel est associé un cône d'altitudes. L'ensemble des routes est optimisé à l'aide d'un algorithme de recuit simulé. Dans ce processus, à chaque itération, chaque route est construite en valuant les arcs du graphe, puis en effectuant une recherche de chemin dans celui-ci. Les coûts des arcs sont choisis de manière à éviter autant que possible les phénomènes de zigzag. Plusieurs tests ont été effectués : un sur un cas artificiel créé spécifiquement pour cette approche, et trois autres sur des cas tirés de la littérature. Les résultats obtenus sont satisfaisants au regard de l'état actuel de la gestion du trafic aérien et des contraintes afférentes
The bottleneck of today's airspace is the Terminal Maneuvering Areas (TMA), where aircraft leave their routes to descend to an airport or take off and reach the en-route sector. To avoid congestion in these areas, an efficient design of departure and arrival routes is necessary. In this work, a solution for designing departure and arrival routes is proposed, which takes into account the runway configuration, the surroundings of the airport and operational constraints such as limited slopes or turn angles. The routes consist of two parts: a horizontal path in a graph constructed by sampling the TMA around the runway, to which is associated a cone of altitudes. The set of all routes is optimized by the Simulated Annealing metaheuristic. In the process and at each iteration, each route is computed by defining adequately the cost of the arcs in the graph and then searching a path on it. The costs are chosen so as to avoid zigzag behaviors as much as possible. Several tests were performed, one on an artificial problem designed specifically to test this approach and the three others on instances taken from the literature. The obtained results are satisfying with regard to the current state of air operations management and constraints
APA, Harvard, Vancouver, ISO, and other styles
3

Бережная, Ольга Владимировна, Ольга Володимирівна Бережна, Olha Volodymyrivna Berezhna, and А. В. Сливченко. "Сравнительный анализ алгоритмов Беллмана-Форда и алгоритма Дейкстры." 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 Search and Breadth First Search methods. Then searching the shortest way help by the specific algorithms as are: Dijkstra´s algorithm, Floyd-Warshall´s algorithm and Bellman-Ford´s algorithm. The last part is devoted to problems with searching minimal frames of graphs with usage Kruskal´s algorithm, Jarnik´s algorithm and Boruvka´s algorithm methods.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Bellman-Ford algorithm"

1

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, 153–60. Dordrecht: Springer Netherlands, 2014. http://dx.doi.org/10.1007/978-94-017-8798-7_19.

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

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, 107–14. Cham: 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
3

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

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, 346–58. Cham: 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, 174–84. Cham: 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, 241–47. Singapore: 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, 239–49. Cham: 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

Boddu, Rama Devi, K. Kishan Rao, and M. Asha Rani. "Energy-Efficient Modified Bellman Ford Algorithm for Grid and Random Network Topologies." In Advances in Intelligent Systems and Computing, 143–51. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2517-1_15.

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

Nepomniaschaya, A. S. "An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs." In Lecture Notes in Computer Science, 285–92. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44743-1_28.

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

Sharma, Garima, Praveen Kumar, and Laxmi Shrivastava. "An Efficient Performance of Enhanced Bellman-Ford Algorithm in Wireless Sensor Network Using K-Medoid Clustering." In Intelligent Computing Applications for Sustainable Real-World Systems, 52–65. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44758-8_6.

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

Conference papers on the topic "Bellman-Ford algorithm"

1

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

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

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). Philadelphia, PA: 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
3

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
4

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

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

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
6

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
7

Mo, Yuanqiu, Soura Dasgupta, and Jacob Beal. "Global Uniform Asymptotic Stability of a Generalized Adaptive Bellman-Ford Algorithm." In 2019 IEEE 58th Conference on Decision and Control (CDC). IEEE, 2019. http://dx.doi.org/10.1109/cdc40024.2019.9029773.

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

Weber, Alexander, Marcus Kreuzer, and Alexander Knoll. "A generalized Bellman-Ford Algorithm for Application in Symbolic Optimal Control." In 2020 European Control Conference (ECC). IEEE, 2020. http://dx.doi.org/10.23919/ecc51009.2020.9143743.

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

Adytoma, Wha Wha, Arief Fatchul Huda, Dian Sa'adillah Maylawati, Nunik Destria Arianti, Wahyudin Darmalaksana, Ali Rahman, and Muhammad Ali Ramdhani. "Automatic Text Summarization for Hadith with Indonesian Text using Bellman-Ford Algorithm." In 2020 6th International Conference on Computing Engineering and Design (ICCED). IEEE, 2020. http://dx.doi.org/10.1109/icced51276.2020.9415864.

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

Dasgupta, Soura, and Jacob Beal. "A Lyapunov analysis for the robust stability of an adaptive Bellman-Ford algorithm." In 2016 IEEE 55th Conference on Decision and Control (CDC). IEEE, 2016. http://dx.doi.org/10.1109/cdc.2016.7799393.

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