An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

Authors:
Etsuji Tomita;Toshikatsu Kameda
Affiliations:
Department of Information and Communication Engineering, The University of Electro-Communications, Tokyo, Japan 182-8585;Department of Information and Communication Engineering, The University of Electro-Communications, Tokyo, Japan 182-8585
Venue:
Journal of Global Optimization
Year:
2007

Citing 0
Cited 23

Supporting Case-Based Retrieval by Similarity Skylines: Basic Concepts and Extensions

ECCBR '08 Proceedings of the 9th European conference on Advances in Case-Based Reasoning
Implicit Groups of Web Pages as Constrained Top N Concepts

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Finding Top-N Pseudo Formal Concepts with Core Intents

MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Polynomial-time solvability of the maximum clique problem

ECC'09 Proceedings of the 3rd international conference on European computing conference
Extended and discretized formulations for the maximum clique problem

Computers and Operations Research
Index coded repetition-based MAC in vehicular ad-hoc networks

CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
The buffered work-pool approach for search-tree based optimization algorithms

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver

Applied Intelligence
Searching for a k-clique in unknown graphs

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Cliques with maximum/minimum edge neighborhood and neighborhood density

Computers and Operations Research
The maximum clique enumeration problem: algorithms, applications and implementations

ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
On the scalability of biocomputing algorithms: The case of the maximum clique problem

Theoretical Computer Science
An algorithm for extracting rare concepts with concise intents

ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
A simple and faster branch-and-bound algorithm for finding a maximum clique

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Finding patterns in an unknown graph

AI Communications - The Symposium on Combinatorial Search
Top-N minimization approach for indicative correlation change mining

MLDM'12 Proceedings of the 8th international conference on Machine Learning and Data Mining in Pattern Recognition
Finding top-n colossal patterns based on clique search with dynamic update of graph

ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Efficient calculation of compound similarity based on maximum common subgraphs and its application to prediction of gene transcript levels

International Journal of Bioinformatics Research and Applications
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

Computational Optimization and Applications
The use of fast approximate graph coloring to enhance exact parallel algorithm performance

AusPDC '12 Proceedings of the Tenth Australasian Symposium on Parallel and Distributed Computing - Volume 127
SQBC: An efficient subgraph matching method over large and dense graphs

Information Sciences: an International Journal
Improvements to MCS algorithm for the maximum clique problem

Journal of Combinatorial Optimization
Speeding up branch and bound algorithms for solving the maximum clique problem

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an exact and efficient branch-and-bound algorithm MCR for finding a maximum clique in an arbitrary graph. The algorithm is not specialized for any particular type of graph. It employs approximate coloring to obtain an upper bound on the size of a maximum clique along with an improved appropriate sorting of vertices. We demonstrate by computational experiments on random graphs with up to 15,000 vertices and on DIMACS benchmark graphs that in general, our algorithm decidedly outperforms other existing algorithms. The algorithm has been successfully applied to interesting problems in bioinformatics, image processing, design of quantum circuits, and design of DNA and RNA sequences for biomolecular computation.