CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

MINIMUM SPANNING TREE ALGORITHM

by Vikas.C.S
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 8
Year of Publication: 2010
Authors: Vikas.C.S
10.5120/185-321

Vikas.C.S . MINIMUM SPANNING TREE ALGORITHM. International Journal of Computer Applications. 1, 8 ( February 2010), 38-44. DOI=10.5120/185-321

@article{ 10.5120/185-321,
author = { Vikas.C.S },
title = { MINIMUM SPANNING TREE ALGORITHM },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 8 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 38-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number8/185-321/ },
doi = { 10.5120/185-321 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:45:12.915577+05:30
%A Vikas.C.S
%T MINIMUM SPANNING TREE ALGORITHM
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 8
%P 38-44
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

An algorithm for minimum spanning tree[1] is discussed here. Apart from the traditional Kruskal's[2] and Prim's[3] algorithm for finding the minimum spanning tree, yet another algorithm for the same purpose is described here. Initially we form a forest and then we convert the forest into the minimum spanning tree.

References
  1. Thomas.H.Corman, Charles.E.Leisserson, Ronald.L.Rivest & Clifford Stein, "Introduction To Algorithms" Second Edition, Page 561.
  2. Thomas.H.Corman, Charles.E.Leisserson, Ronald.L.Rivest & Clifford Stein, "Introduction To Algorithms" Second Edition, Page 567.
  3. Thomas.H.Corman, Charles.E.Leisserson, Ronald.L.Rivest & Clifford Stein, "Introduction To Algorithms" Second Edition, Page 577.
  4. http://en.wikipedia.org/wiki/Greedy_algorithm
  5. http://en.wikipedia.org/wiki/Travelling_salesman_problem
  6. http://en.wikipedia.org/wiki/Kruskal's_algorithm
  7. http://en.wikipedia.org/wiki/Prim%27s_algorithm
Index Terms

Computer Science
Information Sciences

Keywords

Graph: It is a collection of nodes. It mainly consists of two elements -vertices and edges. Vertex: It is simply drawn as a node or dot. Edge: It is a line connecting two vertices. Degree: It is the total number of edges incident on a vertex.

Powered by PhDFocusTM