Article Per Year (5 Year)
p-Index From 2021 - 2026
1.325
P-Index
This Author published in this journals
All Journal Desimal: Jurnal Matematika Cyberspace: Jurnal Pendidikan Teknologi Informasi JTAM (Jurnal Teori dan Aplikasi Matematika) Jurnal Natural J-SIGN (Journal Of Informatics, Information System, And Artificial Intelligence)
Mahyus Ihsan
Universitas Syiah Kuala
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Education Energy Immunology & microbiology Mathematics Neuroscience Physics Social Sciences Other

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

Found 6 Documents
Search
Journal : Jurnal Natural

 1 
IDENTIFY CONNECTIVITY GRAPH USING A MODIFIED PRÜFER’S ALGORITHM LABELLING TREES Al Aiyub; Mahyus Ihsan; Rahma Zuhra
Jurnal Natural Volume 13, Number 1, March 2013
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (444.979 KB)

Abstract

Connectivity of graph easily can be given when we see it with the bare of eyes, but needs an algorithm that can assure the connectivity in computerization. Some graphs require the connectivity in their definitions, such as Hamiltonian graph, Eulerian graph and tree. The connectivity become important in order to solve any of graphs' problems by using computer technology. Most of the algorithm cannot run perfectly, if the graph which is given was not connected. It is happened to Djikstra and Prufer graphs for example. However, this study will provide the solution by modifying Prufer algorithm to show the connectivity in the graph.
Connectivity Algorithm in Simple Graphs Reza Wafdan; Mahyus Ihsan; Rahmah Zuhra
Jurnal Natural Volume 14, Number 1, March 2014
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (193.351 KB)

Abstract

This paper discusses about connectivity algorithm in simple graphs. The algorithm has three stages, namely, adjacent vertices search, adjacent vertices investigation and component investigation. The aim of connectivity algorithm is to check whether a graph is connected or disconnected with the scope set. There are three sets which are used in this algorithm, namely, vertex, edge and adjacent vertices sets. The simple graph is connected if the graph has only one component or if the number of adjacent vertices elements is equal to the number of vertices. Otherwise, if the simple graph has more than one component or if the number of adjacent vertices elements is not equal to the number of vertices then the algorithm will conclude that the graph is disconnected.
SOLUSI PERMASALAHAN KOMPUTASI SKALA BESAR PADA SOFTWARE ADOBE FLASH DALAM PERANCANGAN MEDIA PEMBELAJARAN PENCARIAN EULERIAN CIRCUIT Reza Wafdan; Mahyus Ihsan; Marwan Ramli; Hafnani Hafnani
Jurnal Natural Volume 16, Number 1, March 2016
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (236.963 KB) | DOI: 10.24815/jn.v16i1.4641

Abstract

Adobe Flash is a software that is used to build an interactive contents that can be attached in other things, such as presentations, games and e-learning. The Eulerian Circuit Search Instructional Media is one of examples in using Adobe Flash in building an interactive instructional media to solve graph theory problems. Visually, Adobe Flash is better than other programming software in general and it is the most suitable one for graph theory, as it uses graphics and visuals to solve problems. The weakness of Adobe Flash is when doing large scale calculations; such as when testing algorithms to find Eulerian circuits. Then an idea came about to complete the large scale calculations in Adobe Flash, which is commonly known as script time limit, with using other methodologies by changing script time limit on the settings, algorithms, partition the processes, and utulize the timers within the objects in the actionscript that handles the search algorithms of searching Eulerian circuit.
Non-perfect maze generation using Kruskal algorithm MAHYUS IHSAN; DEDI SUHAIMI; MARWAN RAMLI; SYARIFAH MEURAH YUNI; IKHSAN MAULIDI
Jurnal Natural Volume 21 Number 1, February 2021
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (404.942 KB) | DOI: 10.24815/jn.v21i1.18840

Abstract

A non-perfect maze is a maze that contains loop or cycle and has no isolated cell. A non-perfect maze is an alternative to obtain a maze that cannot be satisfied by perfect maze. This paper discusses non-perfect maze generation with two kind of biases, that is, horizontal and vertical wall bias and cycle bias. In this research, a maze is modeled as a graph in order to generate non-perfect maze using Kruskal algorithm modifications. The modified Kruskal algorithm used Fisher Yates algorithm to obtain a random edge sequence and disjoint set data structure to reduce process time of the algorithm. The modification mentioned above are adding edges randomly while taking account of the edge’s orientation, and by adding additional edges after spanning tree is formed. The algorithm designed in this research constructs an  non-perfect maze with complexity of  where  and  denote vertex and edge set of an  grid graph, respectively. Several biased non-perfect mazes were shown in this research by varying its dimension, wall bias and cycle bias.
Non-perfect maze generation using Kruskal algorithm MAHYUS IHSAN; DEDI SUHAIMI; MARWAN RAMLI; SYARIFAH MEURAH YUNI; IKHSAN MAULIDI
Jurnal Natural Volume 21 Number 1, February 2021
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24815/jn.v21i1.18840

Abstract

A non-perfect maze is a maze that contains loop or cycle and has no isolated cell. A non-perfect maze is an alternative to obtain a maze that cannot be satisfied by perfect maze. This paper discusses non-perfect maze generation with two kind of biases, that is, horizontal and vertical wall bias and cycle bias. In this research, a maze is modeled as a graph in order to generate non-perfect maze using Kruskal algorithm modifications. The modified Kruskal algorithm used Fisher Yates algorithm to obtain a random edge sequence and disjoint set data structure to reduce process time of the algorithm. The modification mentioned above are adding edges randomly while taking account of the edge’s orientation, and by adding additional edges after spanning tree is formed. The algorithm designed in this research constructs an  non-perfect maze with complexity of  where  and  denote vertex and edge set of an  grid graph, respectively. Several biased non-perfect mazes were shown in this research by varying its dimension, wall bias and cycle bias.
SOLUSI PERMASALAHAN KOMPUTASI SKALA BESAR PADA SOFTWARE ADOBE FLASH DALAM PERANCANGAN MEDIA PEMBELAJARAN PENCARIAN EULERIAN CIRCUIT Reza Wafdan; Mahyus Ihsan; Marwan Ramli; Hafnani Hafnani
Jurnal Natural Volume 16, Number 1, March 2016
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24815/jn.v16i1.4641

Abstract

Adobe Flash is a software that is used to build an interactive contents that can be attached in other things, such as presentations, games and e-learning. The Eulerian Circuit Search Instructional Media is one of examples in using Adobe Flash in building an interactive instructional media to solve graph theory problems. Visually, Adobe Flash is better than other programming software in general and it is the most suitable one for graph theory, as it uses graphics and visuals to solve problems. The weakness of Adobe Flash is when doing large scale calculations; such as when testing algorithms to find Eulerian circuits. Then an idea came about to complete the large scale calculations in Adobe Flash, which is commonly known as script time limit, with using other methodologies by changing script time limit on the settings, algorithms, partition the processes, and utulize the timers within the objects in the actionscript that handles the search algorithms of searching Eulerian circuit.
Co-Authors Al Aiyub DEDI SUHAIMI Fahrul Razi Hafnani Hafnani Husaini Husaini Husaini Husaini Ikhsan Maulidi IKHSAN MAULIDI Marwan Ramli Marwan Ramli Maulidi, Ikhsan Rahma Zuhra Rahmadsyah, Rizki Rahmah Zuhra Ramadhan, Teuku Hafiez Reza Wafdan RR. Ella Evrita Hestiandari SYARIFAH MEURAH YUNI Vina Apriliani Zahnur, Zahnur