Sciweavers

IPPS
1998
IEEE
13 years 9 months ago
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 class...
Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuich...