Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. In this paper, a technique has been proposed to use the approximation algo...

Full description

Bibliographic Details
Main Authors:	Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah
Format:	Article
Language:	English English
Published:	Science and Engineering Research Support Society (SERSC) 2018
Subjects:	T Technology (General) T10.5 Communication of technical information
Online Access:	http://irep.iium.edu.my/63287/ http://irep.iium.edu.my/63287/ http://irep.iium.edu.my/63287/7/63287%20Approximate%20maximum%20clique%20algorithm%20SCOPUS.pdf http://irep.iium.edu.my/63287/13/63287_Approximate%20maximum%20clique%20algorithm%20%28AMCA%29.pdf

id	iium-63287
recordtype	eprints
spelling	iium-632872018-07-31T01:26:22Z http://irep.iium.edu.my/63287/ Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem Fayaz, Muhammad Arshad,, Shakeel Shah,, Abdul Salam Shah, Asadullah T Technology (General) T10.5 Communication of technical information Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. In this paper, a technique has been proposed to use the approximation algorithms of Minimum Vertex Cover (MVC) for the solution of the Maximum Cliques (MC) problem. Material and methods: To test the proposed technique, selected approximation algorithms have been developed to small graph instances. The algorithms that were used for experiments are Maximum Degree Greedy (MDG). Vertex support Algorithm (VSA). Mean of Neighbors of Minimum Degree Algorithm (MNMA), Modified Vertex Support Algorithm (MVSA), Maximum Adjacent Minimum Degree Algorithm (MAMA), and Clever Steady Strategy Algorithms (CSSA). Results: The development of an efficient approximation algorithm for the Maximum Clique (MC) problem is very difficult due to its complex nature. The only way left is to use the approximation algorithm of Minimum Vertex Cover (MVC) for the solution of the Maximum Clique (MC) problem. The experimental analysis of the proposed algorithm has revealed that the Maximum Clique (MC) problem can be efficiently solved with approximation algorithms of Minimum Vertex Cover (MVC). The proposed algorithm has efficiently solved the MC problem within the reduced time limit. conclusions: It is a difficult task to directly solve the MC problem through approximation algorithms. The proposed method provides a platform to efficiently solve the MC problem by using approximation algorithm of Minimum Vertex Cover (MVC). Science and Engineering Research Support Society (SERSC) 2018 Article PeerReviewed application/pdf en http://irep.iium.edu.my/63287/7/63287%20Approximate%20maximum%20clique%20algorithm%20SCOPUS.pdf application/pdf en http://irep.iium.edu.my/63287/13/63287_Approximate%20maximum%20clique%20algorithm%20%28AMCA%29.pdf Fayaz, Muhammad and Arshad,, Shakeel and Shah,, Abdul Salam and Shah, Asadullah (2018) Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem. International Journal of control and Automation, 11 (3). pp. 35-44. ISSN 2005-4297 http://www.sersc.org/journals/IJCA/vol11_no3.php
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English
topic	T Technology (General) T10.5 Communication of technical information
spellingShingle	T Technology (General) T10.5 Communication of technical information Fayaz, Muhammad Arshad,, Shakeel Shah,, Abdul Salam Shah, Asadullah Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
description	Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. In this paper, a technique has been proposed to use the approximation algorithms of Minimum Vertex Cover (MVC) for the solution of the Maximum Cliques (MC) problem. Material and methods: To test the proposed technique, selected approximation algorithms have been developed to small graph instances. The algorithms that were used for experiments are Maximum Degree Greedy (MDG). Vertex support Algorithm (VSA). Mean of Neighbors of Minimum Degree Algorithm (MNMA), Modified Vertex Support Algorithm (MVSA), Maximum Adjacent Minimum Degree Algorithm (MAMA), and Clever Steady Strategy Algorithms (CSSA). Results: The development of an efficient approximation algorithm for the Maximum Clique (MC) problem is very difficult due to its complex nature. The only way left is to use the approximation algorithm of Minimum Vertex Cover (MVC) for the solution of the Maximum Clique (MC) problem. The experimental analysis of the proposed algorithm has revealed that the Maximum Clique (MC) problem can be efficiently solved with approximation algorithms of Minimum Vertex Cover (MVC). The proposed algorithm has efficiently solved the MC problem within the reduced time limit. conclusions: It is a difficult task to directly solve the MC problem through approximation algorithms. The proposed method provides a platform to efficiently solve the MC problem by using approximation algorithm of Minimum Vertex Cover (MVC).
format	Article
author	Fayaz, Muhammad Arshad,, Shakeel Shah,, Abdul Salam Shah, Asadullah
author_facet	Fayaz, Muhammad Arshad,, Shakeel Shah,, Abdul Salam Shah, Asadullah
author_sort	Fayaz, Muhammad
title	Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
title_short	Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
title_full	Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
title_fullStr	Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
title_full_unstemmed	Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
title_sort	approximate maximum clique algorithm (amca): a clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
publisher	Science and Engineering Research Support Society (SERSC)
publishDate	2018
url	http://irep.iium.edu.my/63287/ http://irep.iium.edu.my/63287/ http://irep.iium.edu.my/63287/7/63287%20Approximate%20maximum%20clique%20algorithm%20SCOPUS.pdf http://irep.iium.edu.my/63287/13/63287_Approximate%20maximum%20clique%20algorithm%20%28AMCA%29.pdf
first_indexed	2023-09-18T21:29:45Z
last_indexed	2023-09-18T21:29:45Z
_version_	1777412431732015104

Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

Similar Items