文献
J-GLOBAL ID:201302262406927341
整理番号:13A1793852
計算機実験を用いた最大クリークを見つけるための簡潔でより高速な分岐限定法アルゴリズム
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments
著者 (9件):
TOMITA Etsuji
(Advanced Algorithms Res. Lab., The Univ. of Electro-Communications)
,
TOMITA Etsuji
(JST ERATO Minato Discrete Structure Manipulation System Project)
,
TOMITA Etsuji
(Tokyo Inst. of Technol.)
,
SUTANI Yoichi
(Advanced Algorithms Res. Lab., The Univ. of Electro-Communications)
,
SUTANI Yoichi
(Sony Corp.)
,
HIGASHI Takanori
(Advanced Algorithms Res. Lab., The Univ. of Electro-Communications)
,
HIGASHI Takanori
(Japan Systems Co., Ltd.)
,
WAKATSUKI Mitsuo
(Advanced Algorithms Res. Lab., The Univ. of Electro-Communications)
,
WAKATSUKI Mitsuo
(Graduate School of Informatics and Engineering, The Univ. of Electro-Communications)
資料名:
IEICE Transactions on Information and Systems (Institute of Electronics, Information and Communication Engineers)
(IEICE Transactions on Information and Systems (Institute of Electronics, Information and Communication Engineers))
巻:
E96-D
号:
6
ページ:
1286-1298 (J-STAGE)
発行年:
2013年
JST資料番号:
L1371A
ISSN:
0916-8532
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
日本 (JPN)
言語:
英語 (EN)