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.
Reactive local search for maximum clique: A new implementation / Mascia, Franco; Battiti, Roberto. - ELETTRONICO. - (2007), pp. 1-8.
Reactive local search for maximum clique: A new implementation
Mascia, Franco;Battiti, Roberto
2007-01-01
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
newclique.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
365.12 kB
Formato
Adobe PDF
|
365.12 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
