Wamiliana, Wamiliana and Usman, Mustofa and Sakethi, Dwi and Yuniarti, Restu and Cucus, Ahmad (2015) The Hybrid of Depth First Search Technique and Kruskal’s Algorithm for Solving The Multiperiod Degree Constrained Minimum Spanning Tree Problem. In: International Conference on Interactive Digital Media (ICIDM), 1-5 Desember 2015, Bandung.


Download (579kB) | Preview


Given edge weighted graph G(V,E) (all weights are nonnegative) where vertices can represent terminals, cities, etc., and edges can represent cables, road, etc., the Multi Period Degree Constrained Minimum Spanning Tree Problem (MPDCMST) is a problem of finding the total minimum installation cost whilst also maintaining the maximum number of edges incidence to every vertex. The restriction of the links on every vertex occurs to keep the reliability of the network. Moreover, the installation process also divided into some periods due to fund limitation. In this research we will discuss the hybrid between the depth first search technique and Kruskal’s Algorithm applying to solve the MPDCMST problem. Keywords: Multi period, degree constrained minimum spanning tree, installation, depth first search, Kruskal’s algorithm

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika
Depositing User: LPPM . Unila
Date Deposited: 24 Mar 2017 15:28
Last Modified: 24 Mar 2017 15:28
URI: http://repository.lppm.unila.ac.id/id/eprint/1487

Actions (login required)

View Item View Item