A fast algorithm for finding an edge-maximal subgraph with TR-formative coloring
Discrete Applied Mathematics
Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
A branch and bound algorithm for the maximum clique problem
Computers and Operations Research
New methods to color the vertices of a graph
Communications of the ACM
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
An exact algorithm for the maximum clique problem
Operations Research Letters
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms
Computational Optimization and Applications
A logical approach to efficient Max-SAT solving
Artificial Intelligence
A nearly optimal sensor placement algorithm for boundary coverage
Pattern Recognition
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics
A new lower bound for evaluating the performances of sensor location algorithms
Pattern Recognition Letters
Mining the Largest Dense Vertexlet in a Weighted Scale-free Graph
Fundamenta Informaticae
Towards an Iterative Algorithm for the Optimal Boundary Coverage of a 3D Environment
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
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
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
Supply chain for a high stakes testing agency
ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
Comparing the best maximum clique finding algorithms, which are using heuristic vertex colouring
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Word sense disambiguation: a graph-based approach using N-Cliques partitioning technique
NLDB'11 Proceedings of the 16th international conference on Natural language processing and information systems
A new approach for solving the maximum clique problem
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Combinatorial algorithms for the maximum k-plex problem
Journal of Combinatorial Optimization
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
Generalising algorithm performance in instance space: a timetabling case study
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Computational Optimization and Applications
Towards objective measures of algorithm performance across instance space
Computers and Operations Research
| Hi-index | 0.00 |
This paper introduces a branch-and-bound algorithm for the maximum clique problem which applies existing clique finding and vertex coloring heuristics to determine lower and upper bounds for the size of a maximum clique. Computational results on a variety of graphs indicate the proposed procedure in most instances outperforms leading algorithms.