Author:
Katayama Kengo,Hamamoto Akihiro,Narihisa Hiroyuki
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference31 articles.
1. On maximum clique problems in very large graphs;Abello,1999
2. Chained Lin–Kernighan for large traveling salesman problems;Applegate;INFORMS J. Comput.,2003
3. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and the hardness of approximation problems, in: Proc. 33rd Annual Symp. on Foundations of Computer Science, 1992, pp. 14–23
4. Reactive local search for the maximum clique problem;Battiti;Algorithmica,2001
5. Annealed replication: a new heuristic for the maximum clique problem;Bomze;Discrete Appl. Math.,2002
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献