NetMCQ : A Distributed Exact Maximum Clique Solver

スポンサーリンク

概要

論文の詳細を見る
We present NetMCQ, a distributed, exact and efficient branch-and bound algorithm for finding a maximum clique in an arbitrary graph based on the algorithm MCQ. Computational experiments are carried out to demonstrate its efficacy.
一般社団法人情報処理学会の論文
2007-12-20

著者

TOMITA Etsuji
Department of Information and Communication Engineering, and The Advanced Algorithms Research Labora
Tomita Etsuji
Department Of Information And Communication Engineering The University Of Electro-communications
Tomita Etsuji
Department Of Information And Communication Engineering And The Advanced Algorithms Research Laborat
URABE SHOHEI
Department of Information and Communication Engineering, The University of Electro-Communications
Urabe Shohei
Department Of Information And Communication Engineering The University Of Electro-communications
TOMITA ETSUJI
Department of Information and Communication Engineering, The University of Electro-Communications

関連論文

スポンサーリンク