Solving the Maximum Clique Problem Using PUBB

Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a classical NP

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuichi Hirabayashi
• Keywords: Clique, Distributed And Parallel Computing, Heuristic Algorithms Varies, Heuristics, IPPS 1998