Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal EIGEN MATHEMATICS JOURNAL Journal of Fundamental Mathematics and Applications (JFMA)
Erik Maurten Firdaus
Universitas Muhammadiyah Kudus
Decision Sciences, Operations Research & Management Mathematics

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

Found 2 Documents
Search

 1 
KARAKTERISASI DAN BEBERAPA SIFAT RUANG CEC Erik Maurten Firdaus; Ade Ima Afifa Himayati
Journal of Fundamental Mathematics and Applications (JFMA) Vol 4, No 2 (2021)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (993.678 KB) | DOI: 10.14710/jfma.v4i2.12199

Abstract

Abstract. In this paper, we define the notion of CEC spaces. We also study about acharacterization and some properties of CEC spaces such as hereditary, topologicalproperty, finite productive, and divisible.Abstrak. Di dalam tulisan ini, didefinisikan ruang CEC. Dibahas pula karakterisasidan beberapa sifat ruang CEC seperti menurun, sifat topologi, produk berhingga, dan terbagi.
Application of the Greedy Algorithm for Graph Coloring of the Grobogan Regency Map: Application of the Greedy Algorithm for Graph Coloring of the Grobogan Regency Map Ade Ima Afifa Himayati; Muhammad Adib Jauhari Dwi Putra; Erik Maurten Firdaus; Muhammad Faudzi Bahari
Eigen Mathematics Journal Vol. 5 No. 2 Desember 2022
Publisher : University of Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/emj.v5i2.149

Abstract

The district map in Grobogan Regency can be optimized using the Greedy algorithm. The point on the graph represents the district and the line represents two areas that are directly adjacent. Greedy Algorithm is one of the algorithms developed to solve the problem of graph coloring to be able to produce minimal colors that are used without having the same color in areas that are directly adjacent. Greedy’s algorithm uses a set of color candidates and solutions in its solution. Staining is done at the point with the greatest degree followed by an examination of the appropriateness of the color with the principle that no neighboring points have the same color. The resulting color is included in the solution set. The process is continued until all the dots have been colored. Regional coloring in Grobogan district produces four colors with a greedy algorithm as the minimum color solution obtained
Co-Authors Himayati, Ade Ima Afifa Muhammad Adib Jauhari Dwi Putra Muhammad Faudzi Bahari