greg heil wrote: >> ...A clique is a complete subgraph,... > > Actually it is a "Maximal complete subgraph"...though that may not be > important to your problem - If so it would add a complication to your > solution.
Greg: I always get confused with graph theory definitions. I am using the one from Cormen et. al who define a clique to be a complete subgraph and the clique problem to finding a clique of maximum size in a graph. In principle I need all complete subgraphs (=cliques in my terminology): all maximal complete subgraphs would obviously suffice. If they can be too big, there are some things I can do, but right now I am looking at this version. Best wishes, John ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
