esther@dna.lth.se (Esther Jennings) (02/13/91)
Here's a graph problem similar to clique partitioning:
Given a general undirected graph, find maximal disjoint cliques.
The graph may have "left over" vertices and edges after the cliques are
identified. The cliques can be of different sizes but each has at least
3 vertices.
Anyone know of any sequential, parallel or distributed algorithms
(distributed is most interesting)? Complexity of the best known algorithm?
References, also to any related problems would be appreciated. Please reply
by email directly to esther@dna.lth.se Thank you ! Esther Jennings