AN ENUMERATIVE ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM

Sukono, Sukono; Suyudi, Mochamad; Mamat, Mustafa; Bon, Abdul Talib

doi:10.46254/GC01.20190201

Back

1st GCC International Conference on Industrial Engineering and Operations Management

AN ENUMERATIVE ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM

Download PDF

Sukono Sukono , Mochamad Suyudi , Mustafa Mamat & Abdul Talib Bon

Publisher: IEOM Society International

2 Views

3 Downloads

Track: Operations Research

Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. Search results for efficient implementation of any graph for randomly generated graphs of up to 10 vertices and more than ten sides. Appropriate specifications are also provided for testing problems to facilitate future comparisons. In addition, to understand the maximum clique search without using any software. Search results are presented in the form of examples.

Published in: 1st GCC International Conference on Industrial Engineering and Operations Management, Riyadh, Saudi Arabia

Publisher: IEOM Society International
Date of Conference: November 26 -28 , 2019

ISBN: 978-1-5323-5951-4
ISSN/E-ISSN: 2169-8767

Related Research

Critical Factors of Supplier Selection in the Food and Beverage Industry of Saudi Arabia A Fuzzy-TOPSIS Approach

11th Annual International Conference on Industrial Engineering and Operations Management

Published: 2021

Model for Locating Hospitals in a City

5th European International Conference on Industrial Engineering and Operations Management

Published: 2022

Optimal Restoration of Community Structures for Enhancing Interdependent Infrastructure Network Resilience

11th Annual International Conference on Industrial Engineering and Operations Management

Published: 2021