1. Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237–367 (1976)
2. Karypis, D.: METIS a Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices Version 5.1.0, Department of Computer Science & Engineering, University of Minnesota, Minneapolis, March (2013)
3. https://www.glaros.dtc.umn.edu/gkhome/fetch/sw/parmetis/manual.pdf
4. Khan, M.S., Li, K.F.: Fast graph partitioning algorithms. In: IEEE Pacific Rim Conference on Communication, Computers, and Signal Processing, Victoria, B.C., Canada, May 1995, pp. 337–342 (1995)
5. Kerighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. AT&T Bell Labs. Tech. J. 49, 291–307 (1970)