1. Ashcraft, C., Liu, J.W.H.: Using domain decomposition to find graph bisectors. BIT Numerical Mathematics 37(3), 506–534 (1997)
2. Battiti, R., Bertossi, A.A.: Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Trans. Comput. 48(4), 361–385 (1999)
3. Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Computing Surveys (CSUR) 38(1), 2 (2006)
4. Demetrescu, C., Goldberg, A.V., Johnson, D.S.: 9th dimacs challenge 9 benchmark platform, version 1.1(october 30, 2006), http://www.dis.uniroma1.it/~challenge9
5. Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: DAC 1982: Proceedings of the 19th Design Automation Conference, pp. 175–181. IEEE Press, Piscataway (1982)