Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

4.085

P-Index

This Author published in this journals

All Journal AKSIOMA: Jurnal Program Studi Pendidikan Matematika NUMERICAL (Jurnal Matematika dan Pendidikan Matematika) JURNAL EKSAKTA PENDIDIKAN (JEP) JSHP (Jurnal Sosial Humaniora dan Pendidikan) Jurnal Inovasi Pendidikan Ekonomi Abdimas: Jurnal Pengabdian Masyarakat Universitas Merdeka Malang Suluah Bendang: Jurnal Ilmiah Pengabdian Kepada Masyarakat Jurnal Ecogen Jurnal Sosial dan Teknologi Lattice Journal : Journal of Mathematics Education and Applied Lattice Journal : Journal of Mathematics Education and Applied Journal of Mathematics UNP Rangkiang Mathematics Journal JS (Jurnal Sekolah) Ta'dib Jurnal Salingka Nagari Jurnal Infinity

Armiati Armiati

Dosen Matematika FMIPA Universitas Negeri Padang

Author-ID : 2566132

Religion Agriculture, Biological Sciences & Forestry Humanities Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Engineering Environmental Science Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Physics Social Sciences Other

Published : 42 Documents Claim Missing Document

Claim Missing Document

Articles

Title

Menentukan Penjodohan Stabil pada Garaf Bipartisi Berbobot Menggunakan Algoritma Gale-Shapley Himmah Halomoan; Ahmad Fauzan; Armiati Armiati
Journal of Mathematics UNP Vol 6, No 1 (2021): Journal Of Mathematics UNP
Publisher : UNIVERSITAS NEGERI PADANG

Abstract – Stable matching is one of the topics in graph theory, as an application of weighted bipartite graph.On completion of the process of stable matching is used an algorithm is called Gale-Shapley algorithm. To find the stable matching in research, to analyzed stable matching in any weighted bipartite graph with and , any weighted complete bipartite graph with and , as well as also example of the application of stable matching using Gale-Shapley algorithm. Research purposes to determine stable matching in weighted bipartite graph using Gale-Shapley algoritm. The results of this research is using step by step Gale-Shapley algoritm untill get stable matching. Stable matching is only obtained on arbitrary any weighted bipartite graph with and any weighted complete bipartite graph with . In any weighted bipartite graph with and any weighted complete bipartite graph with , obtained maximum matching. Stable matching which has element of a set of large, can be solved with a program Python 3.5.1. Keywords – Matching, Graph, Gale-Shapley Algorithm

Penerapan Pohon Rentang Minimum pada Graph dalam Segmentasi Citra Silvia Alvini; Armiati Armiati; Meira Parma Dewi
Journal of Mathematics UNP Vol 6, No 2 (2021): Journal Of Mathematics UNP
Publisher : UNIVERSITAS NEGERI PADANG

Abstract – Image segmentation is the process of separating the object from the background or of other objects that are not a concern, so the object can be processed for the other purposes. Along with the development of technology in digital image processing application, the segmentation process becomes increasingly necessary. The results of the segmentation must be accurate so that any error does not happen in the interpretation of information from an image. This article discussed the application of the minimum spanning tree on a graph in a segment of an image. This method is able to separate an object from the background so that it produces binary image, which is in this case, the object that being the focus is set in white, while the background is black or otherwise. The whole processes were done by using the Matlab R2013a. Keywords – graph, minimum spanning tree, image segmentation, digital image

Pencarian Clique Maksimal dan Bilangan Clique pada Graf Sederhana Menggunakan Modifikasi Algoritma Clique Shintia Pratiwi; Armiati Armiati; Dewi Murni
Journal of Mathematics UNP Vol 3, No 2 (2018): Journal Of Mathematics UNP
Publisher : UNIVERSITAS NEGERI PADANG

Abstract – Finding maximal clique is a problem to get a clique with the maximum number of points on a graph, where the selected points are the points that are connected to each other. Finding maximal clique in a graph would be easier if using an algorithm. One of algorithms that can be used to determine the maximal clique is clique algorithm. However, the clique algorithm still has a weakness that the process is a relatively long process because it has two procedures. Therefore, in this study a modification to this algorithm. An algorithm not only must be correct, but also must be efficient. The efficiency of an algorithm is measured from the execution time of the algorithm and the space of memory that is required to run it. After modification is done to clique algoritma, the time of complexity asymptotic algorithm gained is .

Co-Authors Ade Laili Jum'ati Surya Adgas Yesa Kriyany Agung Setia Budi Agus Irianto Ahmad Fauzan Ahmad Fauzan Ahmad Fauzan Ahmad Solihin Ali Asmar Anggun Fitri Chintya Novelia Dessi Susanti Dewi Murni Dilla Suryani Dina Aulia Dwita Elfri Mayani Edwin Musdi Eka Pasca Surya Bayu Elita Zusti Jamaan Eriyen Gustina Ulfa Finky’an Syafana Putri Fitry Aryani Hafri Deliani Hamdani Syaputra Hiddiyatul Islami Himmah Halomoan Jelli Anggraini Kafyanti Nurmeli Kamila Rahmayati Karmila Suryani Kasmi Aryuli Khairudin, Khairudin Lufri Lufri M Topit Hidayat Made Arnawa Marwan Marwan Meira Parma Dewi Mohd Hasril Amiruddin Monica Seles Mufida Tullaili Nadya Edlin Nofrinaldi Hendriko Nopiana Helda Novia Holizah Okta Vutri Nupus Putri Rahmadhani Rafki Nasuha Ismail Rahmat Ramadhan Rindu Antika Sari Rose Rahmidani Shintia Pratiwi Silvia Alvini Sulikah Sulikah Susi Evanita Syafriandi Syafriandi Syafriandi Syafriandi Syukhri Syukhri Tri Mulyani Vivi Rizky Aulya Wyanet Putri Alisha Yulyanti Harisman Zikra Aulia

Title Search

Found 3 Documents Search Journal : Journal of Mathematics UNP

Abstract

Abstract

Abstract

Title

Found 3 Documents
Search
Journal : Journal of Mathematics UNP