A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

• Published in: Frontiers in Algorithmics Vol. 9711; pp. 215 - 226
• Main Authors: Tomita, Etsuji, Yoshida, Kohei, Hatta, Takuro, Nagao, Atsuki, Ito, Hiro, Wakatsuki, Mitsuo
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2016; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Algorithms & data structures
• ISBN: 3319398164; 9783319398167
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-39817-4_21

We present improvements to a branch-and-bound maximum-clique-finding algorithm MCS (WALCOM 2010, LNCS 5942, pp. 191–203) that was shown to be fast. First, we employ an efficient approximation algorithm for finding a maximum clique. Second, we make use of appropriate sorting of vertices only near the root of the search tree. Third, we employ a lightened approximate coloring mainly near the leaves of the search tree. A new algorithm obtained from MCS with the above improvements is named MCT. It is shown that MCT is much faster than MCS by extensive computational experiments. In particular, MCT is shown to be faster than MCS for gen400_p0.9_75 and gen400_p0.9_65 by over 328,000 and 77,000 times, respectively.