Download bibtex

Ciaran McCreesh and Patrick Prosser
The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound
ACM Trans. Parallel Comput. 2(1), 8:1--8:27, apr 2015

Ciaran McCreesh and Patrick Prosser
A parallel branch and bound algorithm for the maximum labelled clique problem
Optimization Letters 9(5), 949-960, 2015

Francesco Carrabs, Raffaele Cerulli, and Paolo Dell'Olmo
A Mathematical Programming Approach for the Maximum Labeled Clique Problem
Procedia - Social and Behavioral Sciences 108(0), 69 - 78, 2014

Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, and Panos M. Pardalos
Improvements to MCS algorithm for the maximum clique problem
Journal of Combinatorial Optimization 27(2), 397-416, 2014

Pablo San Segundo and Cristobal Tapia
Relaxed approximate coloring in exact maximum clique search
Computers & Operations Research 44(0), 185 - 192, 2014

David Bergman, Andre A. Cire, Ashish Sabharwal, Horst Samulowitz, Vijay Saraswat, and Willem-Jan Hoeve
Parallel Combinatorial Optimization with Decision Diagrams
Integration of AI and OR Techniques in Constraint Programming, 351-367, 2014

Ciaran McCreesh and Patrick Prosser
Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem
Principles and Practice of Constraint Programming, 549-563, 2014

Pablo San Segundo, Alvaro Lopez, and Mikhail Batsyn
Initial Sorting of Vertices in the Maximum Clique Problem Reviewed
Learning and Intelligent Optimization - 8th International Conference, Lion 8, Gainesville, FL, USA, February 16-21, 2014. Revised Selected Papers, 111–120, 2014

Sadia Sharmin
Practical Aspects of the Graph Parameter Boolean-width
Ph.D. thesis, The University of Bergen 2014

Chu-Min Li, Zhiwen Fang, and Ke Xu
Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem
Tools with Artificial Intelligence (ICTAI), 2013 IEEE 25th International Conference on, 939-946, nov 2013

Ryan A. Rossi, David F. Gleich, Assefaw Hadish Gebremedhin, and Md. Mostofa Ali Patwary
A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components
CoRR, 1-11, 2013

Pablo San Segundo, Fernando Matía, Diego Rodr\'ıguez-Losada, and Miguel Hernando
An improved bit parallel exact maximum clique algorithm
Optimization Letters 7(3), 467-479, 2013

Matjaž Depolli, Janez Konc, Kati Rozman, Roman Trobec, and Dušanka Janežič
Exact Parallel Maximum Clique Algorithm for General and Protein Graphs
Journal of Chemical Information and Modeling 53(9), 2217-2228, 2013

Ciaran McCreesh and Patrick Prosser
Multi-Threading a State-of-the-Art Maximum Clique Algorithm
Algorithms 6(4), 618–635, 2013

Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-Keng Liao, and Alok Choudhary
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Algorithms and Models for the Web Graph, 156-169, 2013

Evgeny Maslov, Mikhail Batsyn, and Panos M. Pardalos
Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements
Models, Algorithms, and Technologies for Network Analysis, 93-99, 2013

Jingen Xiang, Cong Guo, and A. Aboulnaga
Scalable maximum clique computation using MapReduce
Data Engineering (ICDE), 2013 IEEE 29th International Conference on, 74-85, 2013

Patrick Prosser
Exact algorithms for maximum clique: a computational study
Algorithms 5(4), 545–587, 2012

Pablo San Segundo, Diego Rodr\'ıguez-Losada, and Agust\'ın Jiménez
An exact bit-parallel algorithm for the maximum clique problem
Comput. Oper. Res. 38(2), 571–581, feb 2011

Wayne Pullan, Franco Mascia, and Mauro Brunato
Cooperating local search for the maximum clique problem
Journal of heuristics 17(2), 181–199, 2011

John D. Eblen, Charles A. Phillips, Gary L. Rogers, and Michael A. Langston
The Maximum Clique Enumeration Problem: Algorithms, Applications and Implementations
Bioinformatics Research and Applications, 306-319, 2011

Jennifer Debroni, John D. Eblen, Michael A. Langston, Wendy Myrvold, Peter Shor, and Dinesh Weerapurage
A Complete Resolution of the Keller Maximum Clique Problem
Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms, 129–135, 2011

Chu-Min Li, Zhu Zhu, Felip Manyà, and Laurent Simon
Minimum Satisfiability and Its Applications
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume Volume One, 605–610, 2011

Chu-Min Li and Zhe Quan
Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem
Tools with Artificial Intelligence (ICTAI), 2010 22nd IEEE International Conference on, 344-351, oct 2010

Pablo San Segundo, Diego Rodr\'ıguez-Losada, Fernando Matía, and Ramón Galán
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver
Applied Intelligence 32(3), 311-329, 2010

Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, and Mitsuo Wakatsuki
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
WALCOM: Algorithms and Computation, 191-203, 2010

Panos M. Pardalos and Steffen Rebennack
Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs
Experimental Algorithms, 13-22, 2010

Noël Malod-Dognin, Rumen Andonov, and Nicola Yanev
Maximum Cliques in Protein Structure Comparison
Experimental Algorithms, 106-117, 2010

Chu-Min Li and Zhe Quan
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
Proceedings of the Twenty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI} 2010, Atlanta, Georgia, USA, July 11-15, 2010, 2010

Janez Konc and Dušanka Janežič
An improved branch and bound algorithm for the maximum clique problem
MATCH Communications in Mathematical and in Computer Chemistry 58(3), 569-590, jun 2007 howpublished:˜konc/\%C4\%8CLANKI/MATCH58\%283\%29569-590.pdf

Etsuji Tomita and Toshikatsu Kameda
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments
Journal of Global Optimization 37(1), 95-111, 2007

Sergiy Butenko and Wilbert E. Wilhelm
Clique-detection models in computational biochemistry and genomics
European Journal of Operational Research 173(1), 1–17, 2006

Etsuji Tomita, Akira Tanaka, and Haruhisa Takahashi
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science 363(1), 28 - 42, 2006

Jean-Charles Régin
Using Constraint Programming to Solve the Maximum Clique Problem
Principles and Practice of Constraint Programming - {CP} 2003, 634-648, 2003

Etsuji Tomita and Tomokazu Seki
An efficient branch-and-bound algorithm for finding a maximum clique
Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science, 278–289, 2003

Immanuel M. Bomze, Marco Budinich, Panos M. Pardalos, and Marcello Pelillo
The maximum clique problem
Handbook of Combinatorial Optimization (Supplement Volume A), 1–74, 1999

J. Marconi and J.A. Foster
A hard problem for genetic algorithms: finding cliques in Keller graphs
Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on, 650-655, may 1998

Panos M. Pardalos, Jonas Rappe, Mauricio, and Mauricio G.C. Resende
An Exact Parallel Algorithm For The Maximum Clique Problem
In High Performance and Software in Nonlinear Optimization, 279–300, 1998

Eleanor J Gardiner, Peter J Artymiuk, and Peter Willett
Clique-Detection Algorithms for Matching Three-Dimensional Molecular Structures
Journal of Molecular Graphics and Modelling 15(4), 245 - 253, 1997

Mark Brockington and Joseph C. Culberson
Camouflaging independent sets in quasi-random graphs
{DIMACS} series in discrete mathematics and theoretical computer science, 75–88, 1996

Carlo Mannino and Antonio Sassano
Solving hard set covering problems
Operations Research Letters 18(1), 1 - 5, 1995

P. Berman and A. Pelc
Distributed probabilistic fault diagnosis for multiprocessor systems
Fault-Tolerant Computing, 1990. FTCS-20. Digest of Papers., 20th International Symposium, 340-346, jun 1990

G. Levi
A note on the derivation of maximal common subgraphs of two directed or undirected graphs
CALCOLO 9(4), 341-352, 1973