ヤマグチ　カズアキ   Kazuaki Yamaguchi   山口　一章    所属   追手門学院大学  理工学部 情報工学科    職種   教授
言語種別	英語
発行・発表の年月	2008/07
形態種別	外国学会誌（First author）
査読	査読あり
標題	A New Exact Algorithm for the Maximum Weight Clique Problem
執筆形態	共著・編著（代表編著を除く）
掲載誌名	Proceedings of the 23rd International Technical Conference on Circuits/Systems, Computers and Communications
出版社・発行元	The Institute of Electronics, Information and Communication Engineers
巻・号・頁	pp.317-320,pp.F3-1
担当区分	筆頭著者,責任著者
著者・共著者	YAMAGUCHI Kazuaki,MASUDA Sumio
概要	Given an undirected graph with weight for each vertex, the maximum weight clique problem is to find the clique of the maximum weight. Ostergard proposed a fast exact algorithm for solving this problem. We show his algorithm is not efficient for very dense graphs. We propose an exact algorithm for the problem, which is faster than Ostergard's algorithm in case the graph is dense. We show the efficiency of our algorithm with some experimental results.
DOI	10.34385/proc.39.f3-1
ISSN	2188-5079
NAID	230000007366