Prim's algorithm

About: Prim's algorithm is a research topic. Over the lifetime, 775 publications have been published within this topic receiving 17971 citations. The topic is also known as: DJP algorithm & Jarník algorithm.

An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem

Abstract: We propose an algorithm to solve the bottleneck spanning tree problem with an additional linear constraint. Our algorithm has an improved worst case performance over the best known algorithm for this problem. In a graph with n nodes and m edges such that m ≥ O(n log n log log*n), where log* n is the iterative logarithm of n, our algorithm runs in O(m) time and hence is the best possible in that case. For a large class of graphs, the proposed algorithm has almost the same complexity as that of computing just one minimum spanning tree.

Dynamic multi-keyword based search algorithm using modified based fully homomorphic encryption and Prim’s algorithm

Abstract: Cloud provides plenty of storage that makes enterprises to move their precious information/documents to the cloud. Since the user moves their valued data to the cloud, security is a major concern between storage service provider and user. To ascertain the security, the cryptography plays vital role in the searchable encryption based document. In this paper, Dynamic multi keyword based search Algorithm is proposed that contain modified fully homomophic encryption and prims Algorithm. Based on keyword frequency present in the document, keywords are sorted and built searchable index for keyword and files. The dynamic tree is constructed using prim‘s algorithm based on keyword and file. The encrypted files in the tree are indexed to keywords using two way Hash table for efficient search and retrival of documents. The files are encrypted using modified ring based fully homomorphic encryption. The experimental result shows that proposed work provides 80 and 86% encryption and decryption throughput and take less indexing time to index the files than existing RC4+.

Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees

Abstract: In a recent paper [5], we addressed the problem of finding a minimum-cost spanning tree T for a given undirected graph G=(V,E) with maximum node-degree at most a given parameter B>1. We developed an algorithm based on Lagrangean relaxation that uses a repeated application of Kruskal’s MST algorithm interleaved with a combinatorial update of approximate Lagrangean node-multipliers maintained by the algorithm.

An artificial immune approach for service restoration in smart distribution systems

Abstract: The power system reconfiguration is a challenging task. As smart grids concepts develop, different approaches try to take advantage of the grid intelligent features and infrastructure to evolve a fast and robust self-healing scheme. At the distribution level, the self-healing schemes are responsible for performing automatic corrective and self-restorative actions. This task includes managing the service restoration by locating and isolating the fault, and reconfiguring the network topology to decrease the harm. This paper presents a self-healing scheme using Artificial Immune System as an optimization tool to solve the service restoration problem in power systems considering faults within the internal switch breakers. To make this approach suitable for bigger systems, the Prim Algorithm is used due to its capacity to generate minimum spanning trees from a graph. The proposed scheme is tested on benchmark systems to investigate the capacity of proposing feasible solutions for faulted systems.