Direct graph k-partitioning with a Kernighan-Lin like heuristic

Operations Research Letters

Volumn 34, Issue 6, 2006, Pages 621-629

  Larsson Träff, Jesper ^a  

^a NEC LABORATORIES EUROPE   (Germany)

Author keywords

Bipartitioning; Graph partitioning; k partitioning; Kernighan Lin algorithm

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPERATIONS RESEARCH;

BIPARTITIONING; GRAPH PARTITIONING; K-PARTITIONING; KERNIGHAN-LIN ALGORITHM;

GRAPH THEORY;

EID: 33747143374     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.10.003     Document Type: Article

References (17)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows (1993), Prentice-Hall, Englewood Cliffs, NJ
2. G.S. Brodal, Worst-case efficient priority queues, in: Proceedings of the Seventh ACM-SIAM Symposium on Discrete Algorithms (SODA), 1996, pp. 52-58.
3. G.S. Brodal, S. Chaudhuri, J. Radhakrishnan, The randomized complexity of maintaining the minimum, in: Algorithm Theory (SWAT'96), Lecture Notes in Computer Science, vol. 1097, 1996, pp. 4-15.
4. S. Dutt, New faster Kernighan-Lin-type graph-partitioning algorithms, in: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 1993, pp. 370-377.
5. C.M. Fiduccia, R.M. Mattheyses, A linear-time heuristic for improving network partitions, in: 19th ACM/IEEE Design Automation Conference (DAC), 1982, pp. 175-181.
6. Fredman M.L., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34 3 (1987) 596-615
7. B. Hendrickson, R. Leland, A multi-level algorithm for partitioning graphs, in: Proceedings of the 1995 ACM/IEEE Supercomputing Conference, 1995.
8. Karypis G., and Kumar V. Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48 1 (1998) 96-129
9. Karypis G., and Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20 1 (1999) 359-392
10. Kernighan B.W., and Lin S. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49 (1970) 291-307
11. K. Mehlhorn, Data Structures and Algorithms, EATCS Monographs on Theoretical Computer Science, vol. 1, Springer, Berlin, 1984.
12. Papadimitriou C.H., and Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall, Englewood Cliffs, NJ
13. Pellegrini F. Graph partitioning based methods and tools for scientific computing. Parallel Comput. 23 1-2 (1997) 153-164
14. Simon H., and Teng S.-H. How good is recursive bisection. SIAM J. Sci. Comput. 18 5 (1997) 1436-1445
15. M. Snir, S. Otto, S. Huss-Lederman, D. Walker, J. Dongarra, MPI-The Complete Reference, second ed., vol. 1, The MPI Core, MIT Press, Cambridge, MA, 1998.
16. J.L. Träff, Implementing the MPI process topology mechanism, in: Supercomputing, 2002. http://www.sc-2002.org/paperpdfs/pap.pap122.pdf.
17. Walshaw C., and Cross M. Mesh partitioning: a multilevel balancing and refinement algorithm. SIAM J. Sci. Comput. 22 1 (2000) 63-80