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

By: Material type: ArticleArticleDescription: 1286-1298 pSubject(s): In: IEICE Transactions on Information and Systems
Holdings
Item type Current library Call number Vol info Status Date due Barcode
Articles Articles Periodical Section Vol.E96-D, No.06 (Jun. 2013) Available