Reactive local search for maximum clique: A new implementation
暂无分享,去创建一个
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.
[1] Roberto Battiti,et al. Reactive and dynamic local search for Max-Clique, does the complexity pay off? , 2006 .
[2] Roberto Battiti,et al. Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.