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...
محفوظ في:
| المؤلفون الرئيسيون: | , , , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English English |
| منشور في: |
Science and Engineering Research Support Society (SERSC)
2018
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | 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 http://irep.iium.edu.my/63287/ http://www.sersc.org/journals/IJCA/vol11_no3.php |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|