title: Pengembangan Algoritma Modified Prim Untuk Menyelesaikan masalah Instalasi jaringan Multi Tahap
creator: Wibi Cahyo Hastono, 1317051071
subject:  
description: Given a graph G(V,E), and cij ≥ 0,  where V is a set of vertices, and E is the set of edges that connects vertices in V, and cij is the weight of the edge eij,  The Minimum Spanning Tree (MST) Problem is a problem of finding the minimum weight spanning  tree of G.  If we add degree restriction on every vertex of G, the problem becomes a Degree Constrained Minimum Spanning Tree Problem (DCMST). Moreover, if we add another constraint which is period, then the problem arises as The Multi Period Degree Constrained Minimum Spanning Tree  (MPDCMST) Problem. In reality, this problem usually arises on network installation. Prim’s Algorithm is one of famous algorithms that frequently used to solve MST. To use Prim’s algorithm for MPDCMST, we need to do some modifications. In this research we developed six algorithms based on Modified Prim’s algorithm,  named as :WAC1, WAC2, WAC3, WAC4, WAC5 and WAC6. From the results we found that the best solution is Algorithm WAC6.
publisher: Fakultas MIPA
date: 2017-01-25
type: Skripsi
type: NonPeerReviewed
format: text
identifier: http://digilib.unila.ac.id/26028/1/ABSTRAK%20%28ABSTRACT%29.pdf
format: text
identifier: http://digilib.unila.ac.id/26028/2/SKRIPSI%20FULL.pdf
format: text
identifier: http://digilib.unila.ac.id/26028/3/SKRIPSI%20TANPA%20BAB%20PEMBAHASAN.pdf
identifier:   Wibi Cahyo Hastono, 1317051071  (2017) Pengembangan Algoritma Modified Prim Untuk Menyelesaikan masalah Instalasi jaringan Multi Tahap.  Fakultas MIPA, Universitas lampung.     
relation: http://digilib.unila.ac.id/26028/