I am trying to partition an undirected graph into several disjoint graphs. There are several algorithms that can do this if I know the number of partitions that I need. However, for my case, I do not have prior information. Any guidance in this direction will be appreciated.

Similar questions and discussions