Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Unisda Journal of Mathematics and Computer Science (UJMC) JOURNAL OF INFORMATION SYSTEM MANAGEMENT (JOISM)
Niken Retnowati
Universitas Widya Dharma Klaten
Computer Science & IT Education Mathematics

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

Found 3 Documents
Search

 1 
PERBANDINGAN ALGORITMA DJIKSTRA DAN WARSHALL DALAM PENENTUAN LINTASAN TERPENDEK KE KOTA KLATEN Niken Retnowati; Rizka Safitri Lutfiyani
Unisda Journal of Mathematics and Computer Science (UJMC) Vol 4 No 2 (2018): Unisda Journal of Mathematics and Computer Science
Publisher : Mathematics Department of Mathematics and Natural Sciences Unisda Lamongan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (676.572 KB) | DOI: 10.52166/ujmc.v4i2.1132

Abstract

Search for the shortest path is a problem that is faced when we want to travel or go somewhere. Klaten City is one of the cities in Central Java. Cities around Klaten include Boyolali. When we go to Klaten city there are several alternative roads or trails that can be chosen from Boyolali. Mathematically this condition can be applied in graphical form to find the shortest path to the city of Klaten. Determination of the shortest path can be found using the Djikstra Algorithm and the Warshall Algorithm. Researchers tried to compare the two methods to get the most optimal result. From the study concluded that the Djikstra algorithm is more effective than the Warshall algorithm for the shortest path from Boyolali to Klaten.
VIRTUAL FITTING ROOM SEPATU LURIK BERBASIS AUGMENTED REALITY Aryati Wuryandari; Niken Retnowati
Journal of Information System Management (JOISM) Vol. 5 No. 1 (2023): Juni
Publisher : Universitas Amikom Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24076/joism.2023v5i1.1156

Abstract

Pelaku usaha mikro, kecil, dan menengah (UMKM) menjadi yang paling terdampak selama pandemi Covid-19. UMKM mengalami penurunan penjualan dan keuntungan hingga lebih dari 50%. UMKM sepatu lurik pun beralih untuk fokus pemasaran produknya melalui online seperti melalui website ataupun marketplace. Pada umumnya, calon pembeli sepatu lurik harus datang langsung ke toko untuk mencoba sepatu yang diinginkan, tetapi dengan perancangan aplikasi berbasis Augmented Reality (AR) yakni virtual fitting room sepatu dapat menjadi salah satu solusi yang dapat digunakan UMKM sepatu lurik untuk memasarkan produknya lebih luas tanpa harus datang langsung ketoko. Aplikasi yang dikembangkan pada penelitian ini berbasis Android dan bekerja dengan cara menggabungkan model sepatu dalam dunia virtual dengan kaki pengguna pada dunia nyata yang ditangkap oleh kamera depan smartphone pengguna. Pembangunan aplikasi dilakukan dengan metode foot tracking agar model sepatu lurik dapat ditampilkan tepat pada kaki calon pembeli secara tepat.
Pewarnaan Graf Dalam Penentuan Jadwal Ujian Mahasiswa (Studi Kasus Prodi Teknik Informatika Unwidha) Niken Retnowati; Aryati Wuryandari; Agustinus Suradi
UJMC (Unisda Journal of Mathematics and Computer Science) Vol 11 No 1 (2025): Unisda Journal of Mathematics and Computer Science
Publisher : Mathematics Department, Faculty of Sciences and Technology Unisda Lamongan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52166/ujmc.v11i1.9440

Abstract

Often, scheduling final-year student exams becomes a problem within the scope of study programs, one of which is the Informatics Engineering study program at Widya Dharma University, Klaten. This is because the schedule of each examining lecturer is not the same, and besides that, the space available also varies every day. There are several alternative algorithms that can be used to solve scheduling problems, one of which is graph coloring. Graph coloring can include points, lines, and areas. In this research, researchers will try to divide student exam schedules using dot coloring, where the dot coloring algorithm used is Welch Powel The Welch Powell algorithm is the most frequently used graph coloring algorithm. This algorithm starts by sorting the degrees of the graph from largest to smallest, then assigns a color to the vertex at the largest vertex and assigns a different color to the vertices below that are not adjacent to that vertex. Keywords: Welch-Powell algorithm, graph, graph coloring.
Co-Authors Agustinus Suradi Rizka Safitri Lutfiyani