Article Per Year (5 Year)
p-Index From 2019 - 2024
1.556
P-Index
This Author published in this journals
All Journal International Conference on Engineering and Technology Development (ICETD) Explore: Jurnal Sistem Informasi dan Telematika (Telekomunikasi, Multimedia dan Informatika) EXPERT: Jurnal Manajemen Sistem Informasi dan Teknologi Science and Technology Indonesia Digital Transformation Technology (Digitech) ROUTERS: Jurnal Sistem dan Teknologi Informasi Jurnal Pengabdian UMKM
Wiwin Susanty
Universitas Bandar Lampung
Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Environmental Science Languange, Linguistic, Communication & Media Library & Information Science Materials Science & Nanotechnology Physics Other

Published : 20 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Science and Technology Indonesia

 1 
The Diameter and Maximum Link of the Minimum Routing Cost Spanning Tree Problem Reni Permata Sari; Wamiliana; Akmal Junaidi; Wiwin Susanty
Science and Technology Indonesia Vol. 7 No. 4 (2022): October
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (856.521 KB) | DOI: 10.26554/sti.2022.7.4.481-485

Abstract

The minimum routing cost spanning tree (MRCST) is a spanning tree that minimizes the sum of pairwise distances between its vertices given a weighted graph. In this study, we use Campos Algorithm with slight modifications on the coefficient of spanning potential. Those algorithms were implemented on a random table problem data of complete graphs of order 10 to 100 in increments of 10. The goal is to find the diameter (the largest shortest path distance) and the maximum link (the maximum number of edges connecting two vertices) in the spanning tree solution of MRCST. The result shows that a slight modification of the spanning potential coefficients gives better solutions.
Co-Authors . Sutrisno . Wamiliana Ahmad Cucus Akmal Junaidi Andyka Rizky Pratama Ari Kurniawan Saputra Arnes Yuli Vandika Dian Resha Agustina Erlangga Erlangga Fenty Ariani Fikri Rahman Ismail Nanda Astari Muhammad Ardiansyah Putri Oriniati Reni Permata Sari Rexy Hari Rafsanjani Rio Oktora Rudiyan Syafutra AZ Rulan Nur Afiani Suharmoko Taqwan Thamrin Taqwan Thamrin Tia Tanjung Usman Rizal Usman Rizal Yusinta Ria Disanda Yuthsi Aprilinda Zohan Fanani