pith. sign in

arxiv: 1311.3144 · v3 · pith:HHIIZA5Nnew · submitted 2013-11-13 · 💻 cs.DS · cs.DC· math.CO

Recent Advances in Graph Partitioning

Aydin Buluc , Henning Meyerhenke , Ilya Safro , Peter Sanders , Christian Schulz This is my paper
classification 💻 cs.DS cs.DCmath.CO
keywords graphpartitioningrecentadvancesalgorithmsapplicationsbalanceddirections
0
0 comments X
read the original abstract

We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Restoring Sparsity in Potts Machines via Mean-Field Constraints

    cond-mat.stat-mech 2026-02 unverdicted novelty 6.0

    Mean-field constraints restore sparsity in Potts machines by replacing dense pairwise constraint couplings with dynamically updated single-node biases, achieving comparable partitioning quality with reduced density an...