Open AccessApproximate Maximum Clique Algorithm (AMCA): A Clever Technique for Solving the Maximum Clique Problem through Near Optimal Algorithm for Minimum Vertex Cover Problem
Author(s) -
Muhammad Fayaz,
Shakeel Arshad,
Abdul Salam Shah,
Asadullah Shah
Publication year - 2018
Publication title -
international journal of control and automation
Language(s) - English
Resource type - Journals
eISSN - 2207-6387
pISSN - 2005-4297
DOI - 10.14257/ijca.2018.11.3.04
Subject(s) - vertex cover , clique problem , clique , vertex (graph theory) , cover (algebra) , mathematics , algorithm , mathematical optimization , computer science , approximation algorithm , combinatorics , graph , engineering , chordal graph , 1 planar graph , mechanical engineering
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom