loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Duc-Cuong Dang and Aziz Moukrim

Affiliation: Université de Technologie de Compiègne, France

Keyword(s): Maximum clique problem, Memetic algorithm, Triangulated graph, Circular-arc graph.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Genetic Algorithms ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Soft Computing

Abstract: The maximum clique problem involves finding the largest set of pairwise adjacent vertices in a graph. The problem is classic but still attracts much attention because of its hardness and its prominent applications. Our work is based on the existence of an order on all the vertices whereby those belonging to a maximum clique stay close enough to each other. Such an order can be identified via the extraction of a particular subgraph from the original graph. The problem can consequently be seen as a permutation problem that can be addressed efficiently with an evolutionary-like algorithm, here we use a memetic algorithm (MA). Computational experiments conducted on DIMACS benchmark instances clearly show our MA which not only outperforms existing genetic approaches, but also compares very well to state-of-the-art algorithms.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.146.35.203

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Dang, D. and Moukrim, A. (2010). SUBGRAPH EXTRACTION AND MEMETIC ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM. In Proceedings of the International Conference on Evolutionary Computation (IJCCI 2010) - ICEC; ISBN 978-989-8425-31-7, SciTePress, pages 77-84. DOI: 10.5220/0003081000770084

@conference{icec10,
author={Duc{-}Cuong Dang. and Aziz Moukrim.},
title={SUBGRAPH EXTRACTION AND MEMETIC ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation (IJCCI 2010) - ICEC},
year={2010},
pages={77-84},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003081000770084},
isbn={978-989-8425-31-7},
}

TY - CONF

JO - Proceedings of the International Conference on Evolutionary Computation (IJCCI 2010) - ICEC
TI - SUBGRAPH EXTRACTION AND MEMETIC ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM
SN - 978-989-8425-31-7
AU - Dang, D.
AU - Moukrim, A.
PY - 2010
SP - 77
EP - 84
DO - 10.5220/0003081000770084
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic