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

2016 ◽  
pp. 215-226 ◽  
Author(s):  
Etsuji Tomita ◽  
Kohei Yoshida ◽  
Takuro Hatta ◽  
Atsuki Nagao ◽  
Hiro Ito ◽  
...  
Keyword(s):  
Branch And Bound ◽  
Maximum Clique ◽  
Branch And Bound Algorithm

scholarly journals A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments

2013 ◽  
Vol E96.D (6) ◽  
pp. 1286-1298 ◽  
Author(s):  
Etsuji TOMITA ◽  
Yoichi SUTANI ◽  
Takanori HIGASHI ◽  
Mitsuo WAKATSUKI
Keyword(s):  
Branch And Bound ◽  
Maximum Clique ◽  
Branch And Bound Algorithm ◽  
Computational Experiments

A branch and bound algorithm for the maximum clique problem

1992 ◽  
Vol 19 (5) ◽  
pp. 363-375 ◽  
Author(s):  
Panos M. Pardalos ◽  
Gregory P. Rodgers
Keyword(s):  
Branch And Bound ◽  
Maximum Clique ◽  
Branch And Bound Algorithm ◽  
Maximum Clique Problem ◽  
Clique Problem

A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations

1997 ◽  
Vol 28 (5) ◽  
pp. 60-67 ◽  
Author(s):  
Etsuji Tomita ◽  
Ken'ichi Imamatsu ◽  
Yasuhiro Kohata ◽  
Mitsuo Wakatsuki
Keyword(s):  
Branch And Bound ◽  
Maximum Clique ◽  
Branch And Bound Algorithm

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

2010 ◽  
pp. 191-203 ◽  
Author(s):  
Etsuji Tomita ◽  
Yoichi Sutani ◽  
Takanori Higashi ◽  
Shinya Takahashi ◽  
Mitsuo Wakatsuki
Keyword(s):  
Branch And Bound ◽  
Maximum Clique ◽  
Branch And Bound Algorithm
Sign in / Sign up

Export Citation Format

Share Document