##
1.5.1 Clique

##
INPUT OUTPUT

**
Input Description:
**
A graph
*
G=(V,E)
*
.
**
Problem:
**
What is the largest
*
S \subset V
*
such that for all
*
x,y \in S
*
,
*
(x,y) \in E
*
?

##
Implementations

DIMACS Implementation Challenges (FORTRAN) (rating 9)

Neural-Networks for Cliques and Coloring (C) (rating 6)

Combinatorica (Mathematica) (rating 1)

##
Related Problems

Independent Set

Vertex Cover

Go to the corresponding chapter in the book

About the Book

Send us Mail

Go to Main Page

This page last modified on Tue Jun 03, 1997
.