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

@article{Tomita2007AnEB,
  title={An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments},
  author={Etsuji Tomita and Toshikatsu Kameda},
  journal={Journal of Global Optimization},
  year={2007},
  volume={37},
  pages={95-111}
}
  • E. Tomita, T. Kameda
  • Published 2007
  • Mathematics, Computer Science
  • Journal of Global Optimization
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… Expand
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
TLDR
This work focuses on the step-by-step examination of a series of branch-and-bound depth-first search algorithms: Basics, MCQ, MCR, MCS, and MCT, and presents the algorithm, CLIQUES, for enumerating all maximal cliques. Expand
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments
TLDR
This paper proposes new approximate coloring and other related techniques which markedly improve the run time of the branch-and-bound algorithm MCR, and demonstrates the effectiveness of each new techniques in MCS, as well as the overall contribution. Expand
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
TLDR
Improvements to a branch-and-bound maximum-clique-finding algorithm MCS (WALCOM 2010, LNCS 5942, pp. 191–203) that was shown to be fast are presented, and a new algorithm obtained from MCS with the above improvements is named MCT. Expand
A local core number based algorithm for the maximum clique problem
The maximum clique problem (MCP) is to determine a complete subgraph of maximum cardinality in a graph. MCP is a fundamental problem in combinatorial optimization and is noticeable for its wide rangeExpand
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
TLDR
A new encoding from Maxclique into MaxSAT is proposed and used to improve the upper bound based on a partition P of a graph into independent sets for a maximum clique of the graph, which cannot be very tight for imperfect graphs. Expand
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
TLDR
This paper proposes new approximate coloring and other related techniques which markedly improve the run time of the branch-and-bound algorithm MCR, previously shown to be the fastest maximum-clique-finding algorithm for a large number of graphs. Expand
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
State-of-the-art branch-and-bound algorithms for the maximum clique problem (Maxclique) frequently use an upper bound based on a partition P of a graph into independent sets for a maximum clique ofExpand
Exact Parallel Maximum Clique Algorithm for General and Protein Graphs
A new exact parallel maximum clique algorithm MaxCliquePara, which finds the maximum clique (the fully connected subgraph) in undirected general and protein graphs, is presented. First, a new branchExpand
The worst-case time complexity for generating all maximal cliques and computational experiments
TLDR
A depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm, which proves that its worst-case time complexity is O(3n/3) for an n-vertex graph. Expand
The use of fast approximate graph coloring to enhance exact parallel algorithm performance
The significance of graph coloring is considered in the context of reducing the running time of a parallel branch and bound algorithm to solve the maximum clique problem. The greedy colorExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique
TLDR
It is demonstrated by computational experiments on random graphs with up to 15,000 vertices and on DIMACS benchmark graphs that the algorithm remarkably outperforms other existing algorithms in general. Expand
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph
  • E. Sewell
  • Mathematics, Computer Science
  • INFORMS J. Comput.
  • 1998
TLDR
A branch and bound algorithm for finding a maximum stable set in a graph that uses cliques, odd cycles, and a maximum matching on the remaining nodes to construct strong upper bounds. Expand
Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
TLDR
Experiments demonstrate that the combination of cost based filtering and vertex coloring bounds outperforms the old approach as well as approaches that only apply either of these techniques. Expand
A fast algorithm for the maximum clique problem
TLDR
A branch-and-bound algorithm for the maximum clique problem--which is computationally equivalent to the maximum independent (stable) set problem--is presented with the vertex order taken from a coloring of the vertices and with a new pruning strategy. Expand
A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity
TLDR
A new algorithm MAXCLIQUE is proposed which finds a maximum clique in an undirected graph with n vertices, and it is confirmed that it runs faster when two algorithms were used for several random graphs and their average running times were measured. Expand
The worst-case time complexity for generating all maximal cliques and computational experiments
TLDR
A depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm, which proves that its worst-case time complexity is O(3n/3) for an n-vertex graph. Expand
Finding a Maximum Clique in an Arbitrary Graph
TLDR
A new type of branch and bound procedure for finding a maximum clique in an arbitrary graph G, which discusses computational experience on randomly generated graphs with up to 400 vertices and 30,000 edges. Expand
An exact algorithm for the maximum clique problem
A partially enumerative algorithm is presented for the maximum clique problem which is very simple to implement. Computational results for an efficient implementation on an IBM 3090 computer areExpand
Algorithms for Maximum Independent Sets
  • J. Robson
  • Mathematics, Computer Science
  • J. Algorithms
  • 1986
Abstract An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time O (2 0.276 n ) improving on a previous bound of O(2 n 3 ) . The improvement comesExpand
Using symbolic techniques to find the maximum clique in very large sparse graphs
TLDR
A new approach for finding the maximum clique in realistic graphs is presented, built around a classical branch-and-bound, but exploits the efficiency of Binary Decision Diagrams and Symbolic Techniques to avoid explicit enumeration of the search space. Expand
...
1
2
3
4
...