1. Ravindra K Ahuja , Thomas L Magnanti , and James B Orlin . 1988. Network flows . Prentice-Hall Inc . Ravindra K Ahuja, Thomas L Magnanti, and James B Orlin. 1988. Network flows. Prentice-Hall Inc.
2. Konstantinos Ameranis , Antares Chen , Lorenzo Orecchia , and Erasmo Tani . 2023. Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. arXiv preprint arXiv:2301.08920 ( 2023 ). Konstantinos Ameranis, Antares Chen, Lorenzo Orecchia, and Erasmo Tani. 2023. Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. arXiv preprint arXiv:2301.08920 (2023).
3. Local Graph Partitioning using PageRank Vectors
4. Reid Andersen and Kevin J. Lang . 2008 . An Algorithm for Improving Graph Partitions . In Proceedings of the 2008 Annual ACM-SIAM Symposium on Discrete Algorithms(SODA ’08) . Society for Industrial and Applied Mathematics, 651–660. Reid Andersen and Kevin J. Lang. 2008. An Algorithm for Improving Graph Partitions. In Proceedings of the 2008 Annual ACM-SIAM Symposium on Discrete Algorithms(SODA ’08). Society for Industrial and Applied Mathematics, 651–660.
5. Expander flows, geometric embeddings and graph partitioning