Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 150 papers for “Prim's algorithm”

Local limit of Prim's algorithm

Benoît Corsini, Rowel Gündlach, Remco van der Hofstad · ArXiv.org · 2025

We study the local evolution of Prim's algorithm on large finite weighted graphs. When performed for $n$ steps, where $n$ is the size of the graph, Prim's algorithm will construct the minimal spanning tree (MST). We assume that our graphs converge locally in probability to some limiting rooted graph. In that case, Aldous and Steele already proved that the local limit of the MST converges to a limiting object, which can be thought of as the MST on the limiting infinite rooted graph. Our aim is to investigate {\em how} the local limit of the MST is reached \textit{dynamically}. For this, we take $tn+o(n)$ steps of Prim, for $t\in[0,1]$, and, under some reasonable assumptions, show how the local structure interpolates between performing Prim's algorithm on the local limit when $t=0$, to the full local limit of the MST for $t=1$. Our proof relies on the use of the recently developed theory of {\em dynamic local convergence}. We further present several examples for which our assumptions, and thus our results, apply.

Cited by 0Open access

Prim's Algorithm for Optimizing Fiber Optic Trajectory Planning

Siahaan, Andysah · Open Science Framework · 2017

The transition of copper cable technology to fiber optic is very triggering the development of technology where data can be transmitted quickly and accurately. This cable change can be seen everywhere. This cable is an expensive cable. If it is not installed optimally, it will cost enormously. This excess cost can be used to other things to support performance rather than for excess cable that should be minimized. Determining how much cable use at the time of installation is difficult if done manually. Prim's algorithm can optimize by calculating the minimum spanning tree on branches used for fiber optic cable installation. This algorithm can be used to shorten the time to a destination by making all the points interconnected according to the points listed. Use of this method helps save the cost of fiber optic construction.

Cited by 0Open access

Design and Implementation of GPU-Based Prim's Algorithm

Wei Wang, Yongzhong Huang, Shaozhong Guo · International Journal of Modern Education and Computer Science · 2011

Minimum spanning tree is a classical problem in graph theory that plays a key role in a broad domain of applications. This paper proposes a minimum spanning tree algorithm using Prim's approach on Nvidia GPU under CUDA architecture. By using new developed GPU-based Min-Reduction data parallel primitive in the key step of the algorithm, higher efficiency is achieved. Experimental results show that we obtain about 2 times speedup on Nvidia GTX260 GPU over the CPU implementation and 3 times speedup over non-primitives GPU implementation.

Cited by 24Open access

Optimization of Distributed SPARQL Queries Using Edmonds' Algorithm and Prim's Algorithm

Ben Vandervalk, Erin McCarthy, Mark D. Wilkinson · 2009

Here we describe the application of two well known graph algorithms, Edmonds' algorithm and Prim's algorithm, to the problem of optimizing distributed SPARQL queries. In the context of this paper, a ldquodistributed SPARQL queryrdquo is a SPARQL query which is resolved by contacting any number of remote SPARQL endpoints. Two optimization approaches are described. In the first approach, a static query plan is computed in advance of query execution, using one of two standard graph algorithms for finding minimum spanning trees (Edmonds' algorithm and Prim's algorithm). In the second approach, the planning and execution of the query are interleaved, so that as each potential solution is expanded it is permitted to follow an independent query plan. Our optimization approach requires basic statistics regarding RDF predicates which must be obtained prior to the user's query, through automated querying of the remote SPARQL endpoints.

Cited by 16

Tree Based EM-Prim's Algorithm For Energy Efficient Networking

Md. Asif Mahmod tusher Siddique, Nusrath Jahan Happy, Rashedul Kabir et al. · 2019 4th International Conference on Electrical Information and Communication Technology (EICT) · 2019

Network and networking equipment's are one of the biggest contributors to the consumption of energy. To reduce energy consumption in networks, many techniques and algorithms have been developed over the years. But most of the algorithms require complicated computation thus requiring more time and energy. Here, we concentrated on the problem of reducing the number of active links when there is less load on the network. We propose a simple and elegant solution to the problem. We propose to use our EM-Prim's instead of using OSPF, a shortest path-finding algorithms which is used in most cases. Our EM-Prim's algorithm is a tree-based solution to reduce the number of links in a topology. We compared our algorithm with modified Dijkstra's algorithm and tested it against different topologies in case of different demand sizes in this paper and found significant improvements in the reduction of energy in networks.

Cited by 0

Effective bug triage with Prim's algorithm for feature selection

Snehal Chopade, Pournima More · 2017

For constructing any software application or item it is essential to identify the bug in the item while building up the product. At every stage of testing the bug report is created, more of the time is wasted for settling the bug. In settling the bug, software enterprises waste 45 percent of cost. One of the basic systems for settling the bug is bug triage. It is a process for settling the bugs whose fundamental object is to properly allocate a designer to a novel bug for further taking handling. If the assigned developer is busy or not available then this system assigns a new domain specific developer. Initially manual work is accomplished for each time creating the bug report. After that content analysis strategies are functional to conduct normal bug triage. The current framework resists the problem of data reduction in the settling of bugs naturally. Furthermore there is a need of methods which decreases the range likewise enhances the excellence of bug data. For feature collection which is not given precise outcome traditional framework utilized CHI technique. In this way this framework proposed the technique for feature selection by utilizing the Prim's strategy. By joining the instance selection and the feature selection calculations to simultaneously diminish the data scale likewise upgrade precision of the bug reports in the bug triage. By utilizing Prim's strategy, noisy words are removed from the dataset set. From the experimental result it is displayed that accuracy of the proposed system is greater than the accuracy of the existing system.

Cited by 4

Load Restoration in Distribution System using Minimum Spanning Tree - Prim's Algorithm

H Mohamad, Norhasniza Md Razali, N A Salim et al. · International Journal of Recent Technology and Engineering (IJRTE) · 2019

Power outage is detrimental to the grid system therefore solving the issue within a short amount of time is indeed compulsory. Load restoration is one the solution required in ensuring the load can be connected within short amount of time. This study proposes a methodology to solve the load restoration problem using minimum spanning tree by determining the switching sequence according to the Prim’s algorithm. By using this algorithm, the switching is done based on the most minimum path which refer to the flow of power through the minimal value of weighted impedances. This method ensures that the losses is minimized and the voltage limit is not violated. The load restoration in this study focuses on reconfiguring the tie-lines in the 33-bus radial distribution network. Results obtained shows that Prim’s algorithm is effective in restoring the loads by reconfiguring the network in a way that total active power losses are minimized. This algorithm is also compared with the Binary Particle Swarm Optimization (BPSO) to prove the effectiveness of this method thus enhancing the power system reliability.

Cited by 2Open access

The Minimum Spanning Trees of tRNA Sequences Based on Prim's Algorithm

Bowen Chen, Fangping Wei, Jiaxiu Pan et al. · 2009

The minimum spanning tree (MST) model was applied to research the evolutionary relationships of tRNA gene sequences. The MSTs of tRNA gene sequences are constructed by the Prim's algorithm. The topology of the tRNA gene sequences-Ala, Leu, Met and Ser is discussed and shows the relationships among different kinds of tRNA sequences. The result of the MST shows they have the similar structure and behavior which reveals that the tRNA gene may have the fastest and optimized evolutionary path. The topology of MSTs exposes tRNA gene sequences has the homologous fractal structure and its network provides interesting information that the degree distribution becomes the power-law distribution.

Cited by 3

Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs

Sukanta Ghadei, Amaresh Chandra Panada, Surapati Pramanik et al. · SHILAP Revista de lepidopterología · 2025

This research paper presents an innovative approach for determining the minimum spanning tree (MST) in an undirected neutrosophic graph using Prim's Algorithm, which is extensively used in addressing network optimization problems. We analyze the effectiveness of Prim's method for constructing the minimum spanning trees in undirected neutrosophic networks, where edge weights are denoted by neutrosophic numbers. Neutrosophic numbers with components reflecting truth, uncertainty, and Neutrosophic Sets and Systems, Vol. 85, 2025 362 Sukanta Ghadei, Amaresh Chandra Panada,Surapati,Pramanik, Nihar Ranjan Panda, Prasanta Kumar Raut, Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs falsehood provide a more sophisticated method of expressing uncertainty in network modeling. Here, we use a score function to contrast different NMSTs based on weights calculated by adding neutrosophic numbers. This method is particularly beneficial for use in transportation, communication networks, and logistics, where uncertain properties frequently define network configurations. Numerical illustrations prove the effectiveness of the proposed method, showing its efficiency in handling neutrosophic graphs and keeping it computationally feasible. The results indicated that the suggested Prim's algorithm efficiently produces the minimum spanning trees in uncertain environments and is advantageous for network design and optimization in these scenarios.

Cited by 0Open access

Multi-Keyword Search in Encoded Cloud Data Using Homomorphic Encryption and Prim's Algorithm

Anil Baburao Desai, Faiaz Rahat Chowdhury, Charul Sharma et al. · 2023

This popularity of storing data on public encoded cloud servers and granting access to users is growing as a result of the rise of cloud computing. Vast number of researches under this encoded cloud storage encryption methodologies model have been motivated by privacy concerns related to wide search of multi-keywords searching in global cloud data storge in encoded form. The present invention relates to an encryption system, key generation center, and method for searching for encoded data using a sequence of words that can be used by users of any language. Most encoded cloud servers serve multiple users so that everyone can reap the benefits of cloud computing. Our research work proposes an enhanced design of hybrid homographic encryption based multi-keyword search in encoded cloud using prims algorithm (HEmksPA) that enable the cloud based servers to process secured searching without having the knowledge of real user data of both trapdoor and multi-keywords for this we had designed and constructed our novel and enhance multi-keyword search technique. This hybridization of homographic encryption technique with prims calculative scheme leads to an effective way for defeating limitation of previous techniques for multi-keywordsearching with reduced computation time for searching the multi-keywords in encoded cloud. Our obtained result shows that the multi-keywords searching efficiency of our proposed system is 96% when compared with existing techniques which has 94% efficiency described in related work section with enhanced security and confidentiality.

Cited by 1

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

Pavitra, Prajwal M S, Ravi Kumar J K et al. · 2025

This paper introduces a Secure Communication Routing System designed to ensure reliable, efficient, and secure data transmission across modern network environments. Built on the OSI model, the system tackles core challenges such as optimal routing, congestion management, encryption, and error detection. By integrating proven algorithms into a structured, layered approach, it delivers end-to-end security and performance. At the network layer, Prim's Algorithm calculates the most efficient routes using minimum spanning tree logic. TCP Reno is used at the transport layer to handle congestion and ensure reliable packet delivery. Data privacy is protected through a custom encryption scheme at the presentation layer, while CRC at the data link layer checks for transmission errors. A graphical interface provides a clear view of the network topology, selected paths, and live communication updates. Key performance metrics were measured through simulation: the system achieved 100% packet delivery, an average latency of 0.029 seconds, throughput of 10.52 bytes/second, and full CRC validation with no errors. These results validate the system's capability to support secure, dependable, and real-time communication in layered network systems.

Cited by 0

Simulation Of Multiagent Based Distribution Automation Solution For Self-Healing Grids Using Prim'S Algorithm

Prof.Ajitsinh N Jadhav · Zenodo (CERN European Organization for Nuclear Research) · 2015

<strong>Self - healing is the important aspect of the nature in which any system recovers it to the normal level whenever the fault or breakdown occurs. Whenever Electricity is taken into account,then also self - healing of this system should take into consideration. Self - healing is one of the significant features of the smart power system. A self - healing power grid can identify and react to the fault and restore power system with or even no human in tervention [2] . We have experienced the blackout because of the electrici ty power system failure that causes the economic,social life of the people. In the developing country like India,Pakistan,Bangladesh even in the America,there is always been a pro blem of grid failing because of the accident like a car smash into an electricity pole,load shading and natural calamities like tornado,threatening rain,lightening. In this situation the industrial and residential area is most affected by the grid failu re [3].</strong> <strong>https://www.ijiert.org/paper-details?paper_id=140549</strong>

Cited by 0Open access

An Integrated Network Routing Solution Using RIP Protocol, Prim's Algorithm, CRC and TCP Tahoe

Sujatha Badiger, Gagandeep S Cholaki, R Gaurav et al. · 2025

Modern computer networks require sophisticated protocol integration for reliable communication. Current implementations often operate in isolation, limiting effectiveness in real-world scenarios. This research develops a simulation frame-work combining Routing Information Protocol (RIP), Prim's algorithm, TCP Tahoe congestion control, and CRC-16-CCITT error detection. The goal is to design an integrated protocol stack coordinating routing, transport, and error detection lay-ers. The work evaluates performance under realistic conditions and demonstrates cross-layer optimization effectiveness. The framework provides end-to-end communication with dynamic routing and robust error detection. Experimental evaluation using “Computer Network Protocol PBL” data shows 94.7% packet delivery success rate, validating the framework's real-world potential.

Cited by 0

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

Sunil Kumar Kaushik, Shreya V Sanoj, Shreyas Aradhya K et al. · 2025

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 network traffic management, and Cyclic Redundancy Check (CRC) for error detection are all integrated in this hybrid architecture. The system determines the network graph's minimal spanning tree (MST) dynamically using Prim's technique, guaranteeing the quickest and least expensive routes for packet delivery. Data confidentiality and integrity are protected during transmission by RSA encryption. By using slow start, congestion avoidance, and retransmission techniques, the TCP Tahoe congestion control system helps to avoid packet loss and network congestion. CRC is also used to identify and address data corruption at the receiving end. The suggested architecture performs better in terms of bandwidth usage, transmission delay reduction, and safe and dependable data delivery. The outcomes of the sample simulation confirm that the integrated strategy works well in a variety of network settings. With sample five chunks sent and four successfully delivered, the findings specifically display an average latency per packet of 1.255 seconds, a packet delivery ratio (PDR) of 80%, and a packet loss rate of 20%.

Cited by 0

Enhancing energy balance in wireless sensor networks through optimized minimum spanning tree

Hafiz Muhammad Saad, Ahmed Younes Shdefat, Asif Nawaz et al. · PeerJ Computer Science · 2024

Wireless sensor networks (WSNs) are important for applications like environmental monitoring and industrial automation. However, the limited energy resources of sensor nodes pose a significant challenge to the network's longevity. Energy imbalances among nodes often result in premature failures and reduced overall network lifespan. Current solutions have not adequately addressed this issue due to network dynamics, varying energy consumption rates, and uneven node distribution. To tackle this, we propose a novel method using Prim's algorithm to construct minimum spanning trees (MSTs) that enhance energy balance in WSNs. Prim's algorithm effectively identifies optimal connections among network nodes to minimize energy consumption. Our methodology includes several key steps: network initialization, energy consumption modeling, MST construction using Prim's algorithm, and optimizing the movement of mobile sink nodes. Extensive experiments with diverse datasets show that our approach significantly improves energy equilibrium, demonstrating high sensitivity and moderate complexity. This research underscores the potential of Prim's algorithm to extend the lifespan of WSNs and enhance energy efficiency, contributing to sustainable and effective network deployments.

Cited by 3Open access

Optimal Service Reconfiguration and Restoration of Network using Cuckoo - Search and Prim's Algorithms

T. D. Sudhakar, H. Prasad · 2023

This study proposes a hybrid technique for solving the problem of optimal service reconfiguration and restoration of distribution network with Cuckoo-Search algorithm and Prim's algorithm. Network reconfiguration problem is done to minimize the losses in the network during varying load conditions. Service Restoration is an application of reconfiguration problems done during line outage conditions in the distribution network. Network reconfiguration problem are difficult to solve, because of two criteria. The first criteria is to identify the switching sequence as there are large number of sectionalizing and tie switches involved, since for ‘m’ switches in the network, the combinations will be of the order of 2m, and the second is to satisfy the radial conditions. Therefore, this research work applied Cuckoo-Search technique and Prim's algorithm to find the desirable switching sequence thereby reducing the search space for a particular load condition of the network. In this Cuckoo-search algorithm is used to generate various switching sequence and the Prim's algorithm is utilized to check the radial condition. The MATLAB simulation of Cuckoo-Search and Prim's algorithm is implemented in a 33 - bus IEEE test distribution network. The results show that not only the loss reduction but also voltage improvement during the distribution networks service reconfiguration and restoration.

Cited by 1