Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Journal of Mathematics UNP
Shintia Pratiwi
Mathematics Department Universitas Negeri Padang
Computer Science & IT Decision Sciences, Operations Research & Management Mathematics

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

Found 1 Documents
Search

 1 
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

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (953.154 KB) | DOI: 10.24036/unpjomath.v3i2.4682

Abstract

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 Armiati Armiati Dewi Murni