Reactive local search for maximum clique: A new implementation
Roberto Battiti, Franco Mascia · Unitn Eprints Research (Università Degli Studi di Trento) · 2007
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.