Recent Advances in Graph Partitioning
Aydin Buluc, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian, Schulz
TL;DR
This paper surveys recent practical algorithms for balanced graph partitioning, highlighting current trends, applications, and future research directions in the field.
Contribution
It provides a comprehensive overview of recent advances in graph partitioning algorithms and discusses potential future research avenues.
Findings
Identification of key recent algorithms
Discussion of practical applications
Outline of future research directions
Abstract
We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVLSI and FPGA Design Techniques · Advanced Graph Theory Research · Digital Image Processing Techniques