Keyword : maximum clique

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments
Etsuji TOMITA Yoichi SUTANI Takanori HIGASHI Mitsuo WAKATSUKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/06/01
Vol. E96-D  No. 6 ; pp. 1286-1298
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
maximum clique, branch-and-bound, approximate coloring, computational experiments, 
 Summary | Full Text:PDF(791.5KB)
Comparisons of Energy-Descent Optimization Algorithms for Maximum Clique Problems
Nobuo FUNABIKI Seishi NISHIKAWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/04/25
Vol. E79-A  No. 4 ; pp. 452-460
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
maximum clique, NP-complete, neural network, algorithm, energy-descent opimization, 
 Summary | Full Text:PDF(605.7KB)