Battiti, Roberto and Mascia, Franco (2007) Reactive local search for maximum clique: A new implementation. UNSPECIFIED. (Unpublished)
![[img]](http://eprints.biblio.unitn.it/style/images/fileicons/application_pdf.png)
| PDF Download (365Kb) | Preview |
Abstract
This paper presents algorithmic and implementation enhancements of Reactive Local Search algorithm for the Maximum Clique problem [3]. In addition, we build an empirical complexity model for the CPU time required for a single iteration, and we show that with a careful implementation of the data structures one can achieve a speedup of at least an order of magnitude difference for large size graphs.
| Item Type: | Departmental Technical Report |
|---|---|
| Department or Research center: | Information Engineering and Computer Science |
| Subjects: | Q Science > QA Mathematics > Q360 Information Theory Q Science > QA Mathematics > QA075 Electronic computers. Computer science Q Science > QA Mathematics > QA076 Computer software |
| Report Number: | DIT-07-018 |
| Repository staff approval on: | 29 May 2007 |
Actions (login required)
| View Item |
