An effective local search for the maximum clique problem

Authors:
Kengo Katayama;Akihiro Hamamoto;Hiroyuki Narihisa
Affiliations:
Department of Information and Computer Engineering, Okayama University of Science, 1-1 Ridai-cho, Okayama 700-0005, Japan;Department of Information and Computer Engineering, Okayama University of Science, 1-1 Ridai-cho, Okayama 700-0005, Japan;Department of Information and Computer Engineering, Okayama University of Science, 1-1 Ridai-cho, Okayama 700-0005, Japan
Venue:
Information Processing Letters
Year:
2005

Citing 14
Cited 9

Approximating clique is almost NP-complete (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A neural network model for finding a near-maximum clique

Journal of Parallel and Distributed Computing - Special issue on neural computing on massively parallel processing
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Journal of Heuristics
Annealed replication: a new heuristic for the maximum clique problem

Discrete Applied Mathematics
Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Local Optimization and the Traveling Salesman Problem

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A fast algorithm for the maximum clique problem

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Chained Lin-Kernighan for Large Traveling Salesman Problems

INFORMS Journal on Computing
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning

Evolutionary Computation
Proof verification and hardness of approximation problems

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Searching for maximum cliques with ant colony optimization

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
An efficient branch-and-bound algorithm for finding a maximum clique

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science

Mining the Largest Dense Vertexlet in a Weighted Scale-free Graph

Fundamenta Informaticae
Iterated k-opt local search for the maximum clique problem

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Fast local search for the maximum independent set problem

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Memetic algorithm with strategic controller for the maximum clique problem

Proceedings of the 2011 ACM Symposium on Applied Computing
Breakout Local Search for maximum clique problems

Computers and Operations Research
Quasi-elementary landscapes and superpositions of elementary landscapes

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
An adaptive multistart tabu search approach to solve the maximum clique problem

Journal of Combinatorial Optimization
Fairness Guaranteed Cooperative Resource Allocation in Femtocell Networks

Wireless Personal Communications: An International Journal
SQBC: An efficient subgraph matching method over large and dense graphs

Information Sciences: an International Journal

Quantified Score

Hi-index	0.89

An effective local search for the maximum clique problem

Quantified Score

Visualization

Abstract