Journal of Mathematics UNP
Vol 3, No 2 (2018): Journal Of Mathematics UNP

Pencarian Clique Maksimal dan Bilangan Clique pada Graf Sederhana Menggunakan Modifikasi Algoritma Clique

Shintia Pratiwi (Mathematics Department Universitas Negeri Padang)
Armiati Armiati (Mathematics Department Universitas Negeri Padang)
Dewi Murni (Mathematics Department Universitas Negeri Padang)

Article Info

Publish Date
17 Dec 2018

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 .

Copyrights © 2018




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
953.154 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Journal of Mathematics UNP
Website

Abbrev

mat

Publisher

Universitas Negeri Padang

Subject

Computer Science & IT Decision Sciences, Operations Research & Management Mathematics

Description

Journal of Mathematics UNP is a journal to publish article from student researches in UNP Mathematics study program, and we also kindly accept other article from outside of our study program related to Mathematics: consists of publication in Algebra, Analysis, Combinatoric, Geometry, Differential ...