The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm
Let <inline-formula><math display="inline"><semantics><mrow><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo></mrow></semantics></math></inl...
Main Authors: | Derek H. Smith, Roberto Montemanni, Stephanie Perkins |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-10-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/13/10/253 |
Similar Items
-
Exact Algorithms for Maximum Clique: A Computational Study
by: Patrick Prosser
Published: (2012-11-01) -
An Efficient Local Search for the Maximum Edge Weighted Clique Problem
by: Ruizhi Li, et al.
Published: (2018-01-01) -
NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem
by: Neda Mohammadi, et al.
Published: (2020-01-01) -
Exact Maximum Clique Algorithm for Different Graph Types Using Machine Learning
by: Kristjan Reba, et al.
Published: (2021-12-01) -
MEAMCP: A Membrane Evolutionary Algorithm for Solving Maximum Clique Problem
by: Ping Guo, et al.
Published: (2019-01-01)