Maximal Clique
Friday, 15. February 2008, 05:57:40
1. Definition
---Yun Zhang at UTK
2. Some papers on maximal cliques (and independent sets) enumeration problems:
[1] An Analysis of Some Graph Theoretical Cluster Techniques
[2] Corrections to Bierstone's Algorithm for Generating Cliques
[3] A New Algorithm for Generating All the Maximal Independent Set
3. Dr. Kevin O'Neill provided C implementation for algorithms proposed in paper [3].
A maximal clique is a complete subgraph that is not contained in any other complete subgraph. Among all maximal cliques, the largest one is the maximum clique. The clique problem is one of the basic NP-complete problems.
---Yun Zhang at UTK
2. Some papers on maximal cliques (and independent sets) enumeration problems:
[1] An Analysis of Some Graph Theoretical Cluster Techniques
[2] Corrections to Bierstone's Algorithm for Generating Cliques
[3] A New Algorithm for Generating All the Maximal Independent Set
3. Dr. Kevin O'Neill provided C implementation for algorithms proposed in paper [3].
WIDGETIZE
How to use Quote function: