Pengembangan Algoritma Modified Prim Untuk Menyelesaikan masalah Instalasi jaringan Multi Tahap

Wibi Cahyo Hastono, 1317051071 (2017) Pengembangan Algoritma Modified Prim Untuk Menyelesaikan masalah Instalasi jaringan Multi Tahap. Fakultas MIPA, Universitas lampung.

[img]
Preview
Text
ABSTRAK (ABSTRACT).pdf

Download (110Kb) | Preview
[img] Text
SKRIPSI FULL.pdf
Restricted to Registered users only

Download (1335Kb) | Request a copy
[img]
Preview
Text
SKRIPSI TANPA BAB PEMBAHASAN.pdf

Download (1036Kb) | Preview

Abstrak

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.

Tipe Karya Ilmiah: Skripsi
Subyek: Q Science (General)
Program Studi: Fakultas MIPA > Prodi Ilmu Komputer
Depositing User: 1712917 . Digilib
Date Deposited: 09 Mar 2017 03:22
Last Modified: 09 Mar 2017 03:22
URI: http://digilib.unila.ac.id/id/eprint/26028

Actions (login required)

View Item View Item