Add KB entry: optimizing LP in graph clustering (1.23x)#1
Merged
schulzchristian merged 2 commits intomainfrom Mar 28, 2026
Merged
Add KB entry: optimizing LP in graph clustering (1.23x)#1schulzchristian merged 2 commits intomainfrom
schulzchristian merged 2 commits intomainfrom
Conversation
30 experiments on KaHIP's ScalableCorrelationClustering yielded 1.23x speedup via dense vectors replacing hash maps, counting-sort contraction, LP sweep specialization, and allocation elimination. Includes full experiment log with 18 kept and 12 discarded hypotheses.
Each optimization now includes the root cause, the fix, and why it helps at the hardware/memory level. Enough detail to reproduce each technique on a similar multilevel graph framework.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary