Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph
INFORMS Journal on Computing
An algorithm for finding a maximum clique in a graph
Operations Research Letters
Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
An effective local search for the maximum clique problem
Information Processing Letters
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science - Computing and combinatorics
On places suitable for applying AI principles in NP-hard graph problems' algorithms
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
A Branch and Bound Algorithm for Matching Protein Structures
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Data Mining of Time-Series Medical Data by Formal Concept Analysis
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Polynomial-time solvability of the maximum clique problem
ECC'09 Proceedings of the 3rd international conference on European computing conference
An effective local search for the maximum clique problem
Information Processing Letters
An extended branch and bound search algorithm for finding top-N formal concepts of documents
JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
Iterated k-opt local search for the maximum clique problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A Max-SAT inference-based pre-processing for Max-clique
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Applying AI and incomplete solution principles to solve NP-hard problems in the real-time systems
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Comparing the best maximum clique finding algorithms, which are using heuristic vertex colouring
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Finding maximal cliques in massive networks
ACM Transactions on Database Systems (TODS)
A method for pinpoint clustering of web pages with pseudo-clique search
Proceedings of the 2005 international conference on Federation over the Web
A new algorithm for enumerating all maximal cliques in complex network
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Combinatorial algorithms for the maximum k-plex problem
Journal of Combinatorial Optimization
An algorithm for extracting rare concepts with concise intents
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Finding significant web pages with lower ranks by pseudo-clique search
DS'05 Proceedings of the 8th international conference on Discovery Science
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
Optimizing with minimum satisfiability
Artificial Intelligence
An adaptive multistart tabu search approach to solve the maximum clique problem
Journal of Combinatorial Optimization
Relaxed approximate coloring in exact maximum clique search
Computers and Operations Research
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
Hi-index | 0.00 |
We present an exact and efficient branch-and-bound algorithm for finding a maximum clique in an arbitrary graph. The algorithm is not specialized for any particular kind of graph. It employs approximate coloring and appropriate sorting of vertices to get an upper bound on the size of a maximum clique. We demonstrate by computational experiments on random graphs with up to 15,000 vertices and on DIMACS benchmark graphs that our algorithm remarkably outperforms other existing algorithms in general. It has been successfully applied to interesting problems in bioinformatics, image processing, the design of quantum circuits, and the design of DNA and RNA sequences for biomolecular computation.