You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently using the Kernighan-Lin Grouping Method, only power of 2 group splits are supported. This is impractical for some course sizes if the goal is to create groups of a certain size. For instance, in a course size of 50, 8 groups results in very large groups of 6 members, but 16 groups results in small groups of 3.
I don't know the algorithm very well, but some hasty research revealed similar algorithms that can do unbalanced partitioning, such as shemetis (from this article)
shmetis can handle non-power of 2 partitions, by performing unbalanced bisections. That is, for a 3-way partition it computes a 2-way partition such that the first part has 2/3 of the total number of vertices, and the other part has 1/3. It then it bisects the first part into two equal-size parts,
each containing 1/3 of the original number of vertices.
The text was updated successfully, but these errors were encountered:
Checking in. I see the issue is assigned, but not responded.
Alternately, dummy group can be created that balance out Kernighan-Lin's partitioning method and then discarded when output is created. That is, if you have 50 members, and want groups of about 4, 4 dummy groups can be created to make 16 groups and the 4 dummy groups with no members can be discarded.
Unfortunately, this repository does not have a current maintainer -- I think the parties involved (@gkapfham, @huangs1, @barrezuetai, and others) would be willing to answer questions about implementations, but probably don't have the bandwidth to make any changes at this time.
Currently using the Kernighan-Lin Grouping Method, only power of 2 group splits are supported. This is impractical for some course sizes if the goal is to create groups of a certain size. For instance, in a course size of 50, 8 groups results in very large groups of 6 members, but 16 groups results in small groups of 3.
I don't know the algorithm very well, but some hasty research revealed similar algorithms that can do unbalanced partitioning, such as shemetis (from this article)
The text was updated successfully, but these errors were encountered: