UCSY's Research Repository

Finding Minimum Spanning Tree

Show simple item record

dc.contributor.author Htun, Sai Zaw Moe
dc.date.accessioned 2019-08-02T04:12:36Z
dc.date.available 2019-08-02T04:12:36Z
dc.date.issued 2009-08-03
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1602
dc.description.abstract This paper studies the Minimum Spanning Tree Methods. A graph is a collection of nodes and edges, but has no rules dictating the connection among the nodes. All trees are graphs. A tree is a special case of graph in which all nodes are reachable from some starting node and one that has no cycles. There are typically many spanning tree in an undirected graph such that the sum of the lengths of tree’s edges is as small as possible by using Kruskal’s Algorithm, Prim’s Algorithm and Genetic Algorithm, This system is implemented by using Microsoft Visual Studio C#2008. en_US
dc.language.iso en en_US
dc.publisher Third Local Conference on Parallel and Soft Computing en_US
dc.title Finding Minimum Spanning Tree en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account