Welcome to KaHIP Discussions! #67
Replies: 3 comments 6 replies
-
|
Hello @schulzchristian, first of all I'd like to thank you (and your colleagues) for the hard work put into this library. I have started using KaHIP in a personal web project (https://github.com/mhoff/meshup) which uses KaFFPa as a WebAssembly build (https://github.com/mhoff/KaHIP-wasm) for a specific problem statement, which is surely not the primary focus of this library. I am using KaFFPa on a potentially fully meshed, edge-weighted graph of people (=nodes) to generate subgroups (=partitions). The basic concept already works, however what I desire is more control over the individual sizes of the final partitions. Intuitive example: except for the trivial case n=1, there shall never be a partition with only one member (as the app is about people in a partition connecting with each other). In general, I would like the user to define a range of acceptable group sizes, around a primary group size which is always preferred. I realize that I probably need to implement that myself in or on top of KaFFPa. In the short run, I have already considered simply merging partitions with a single member into another partition. But I want to, as well as possible, retain (heuristic) optimality. I would very much appreciate some hints on how to tackle that problem :) Here is a productive deployment of the app: https://meshup.mhoff.net/ |
Beta Was this translation helpful? Give feedback.
-
|
Dear Michael, thank you using KaHIP! Lets discuss in a brief meeting, so lets schedule one. Could you send me an email to christian.schulz@informatik.uni-heidelberg.de? @DanielSeemaier do you also want to join the meeting? Best |
Beta Was this translation helpful? Give feedback.
-
|
Sure |
Beta Was this translation helpful? Give feedback.
-
|
Many thanks! I have sent you both an email :) |
Beta Was this translation helpful? Give feedback.
-
|
Hello @schulzchristian. |
Beta Was this translation helpful? Give feedback.
-
|
it minimizes the sum of the edge weights running between blocks (you call subgraphs). If the graph is unweighted, weights are assumed to be one, so it is the number of edges. If there are weights, it is really the sum of the weights that is minimized. |
Beta Was this translation helpful? Give feedback.
-
|
Thank you for clarification. |
Beta Was this translation helpful? Give feedback.
-
|
Yes, simply set the number of blocks k to the desired numver of blocks.
Best
Christian
…On Wed, 19 Jul 2023, 14:13 idubinkin, ***@***.***> wrote:
Thank you for clarification.
Can it break a graph in a number of blocks that is not a power of 2?
—
Reply to this email directly, view it on GitHub
<#67 (reply in thread)>,
or unsubscribe
<https://github.com/notifications/unsubscribe-auth/ABLP7SR22RYW7E4VPP45OUDXQ7FPJANCNFSM4UVH3F6A>
.
You are receiving this because you were mentioned.Message ID:
***@***.***>
|
Beta Was this translation helpful? Give feedback.
-
|
Thank you. |
Beta Was this translation helpful? Give feedback.
-
👋 Welcome!
We’re using Discussions as a place to connect with other members of our community. We hope that you:
build together 💪.
To get started, comment below with an introduction of yourself and tell us about what you do with this community.
Beta Was this translation helpful? Give feedback.
All reactions