Results 211 to 220 of about 5,015,001 (272)

Modeling Prim's Algorithm for Tour Agencies' Minimum Traveling Paths to Increase Profitability

International Conference on Information Management and Technology, 2020
This study aims at modeling tour agencies' best traveling paths using prim's algorithm and applicable in any tourism cities. In this case we take the area of Greater Malang, which has a lot of tourism sites, as part of this study.
A. V. Dian Sano, Hendro Nindito, Evaristus Didik Madyatmadja, C. Sianipar   +3 more
semanticscholar   +2 more sources

Combine Prim's Algorithm, RSA Encryption, TCP Tahoe Congestion Control, and CRC for Efficient Routing and Error Detection

2025 9th International Conference on Computational System and Information Technology for Sustainable Solutions (CSITSS)
Ensuring effective data transfer while preserving security and dependability is a crucial challenge in contemporary computer networks. Prim's algorithm for efficient route routing, RSA encryption for safe data transfer, TCP Tahoe congestion control for ...
Samrudh R Kaushik, Shreya V Sanoj, Shreyas Aradhya K, Kiran V   +3 more
semanticscholar   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Board Game Supporting Learning Prim’s Algorithm and Dijkstra’s Algorithm

International Journal of Multimedia Data Engineering and Management, 2010
The concept of minimum spanning tree algorithms in data structure is difficult for students to learn and to imagine without practice. Usually, learners need to diagram the spanning trees with pen to realize how the minimum spanning tree algorithm works.
Wen-Chih Chang, Te-Hua Wang, Yan-Da Chiu
openaire   +2 more sources

Learning Kruskal’s Algorithm, Prim’s Algorithm and Dijkstra’s Algorithm by Board Game

International Conference on Advances in Web-Based Learning, 2008
This paper describes the reasons about why it is beneficial to combine with graph theory and board game. Forbye, it also descants three graph theories: Dijkstra's, Prim's, and Kruskal's minimum spanning tree. Then it would describe the information about the board game we choose and how to combine the game with before-mentioned three graph theories.
Wen-Chih Chang, Yan-Da Chiu, Mao-Fan Li
openaire   +2 more sources

The expected complexity of Prim's minimum spanning tree algorithm

Information Processing Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chip Martel
openaire   +3 more sources

End-to-End Encrypted Routing Framework with CRC-Based Integrity and Prim's Algorithm

2025 9th International Conference on Computational System and Information Technology for Sustainable Solutions (CSITSS)
This paper introduces a Secure Communication Routing System designed to ensure reliable, efficient, and secure data transmission across modern network environments.
Pavitra, Prajwal M S, R. J. K, Kiran V
semanticscholar   +2 more sources

A SURVEY OF PRIM’S ALGORITHM

International Journal of Recent Advancement in Engineering & Research, 2017
Rushita Acharya
openaire   +2 more sources

Prim's algorithm

, 2001
Saul I. Gass, Carl M. Harris
openaire   +2 more sources

Generating spanning tree of non-regular graphic sequences through a variant of Prim's algorithm

2015 International Conference on Circuits, Power and Computing Technologies [ICCPCT-2015], 2015
Prantik Biswas, Abhisek Paul, P. Bhattacharya   +2 more
semanticscholar   +2 more sources

The analysis and application of Prim algorithm, Kruskal algorithm, Boruvka algorithm

Applied and Computational Engineering, 2023
Minimum spanning tree has many applications in real life. For example, the government needs to build roads between many cities. Therefore, it is necessary to find the plan with the shortest path to save the cost. The problem is essentially generating a minimal spanning tree, and it require a suitable algorithm to find the minimum spanning tree. In this
openaire   +1 more source