Yoichi SUTANI


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 cliquebranch-and-boundapproximate coloringcomputational experiments
 Summary | Full Text:PDF