
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Youssef G. Saab, "An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs," IEEE Transactions on Computers, vol. 53, no. 6, pp. 641652, June, 2004.  
BibTex  x  
@article{ 10.1109/TC.2004.3, author = {Youssef G. Saab}, title = {An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs}, journal ={IEEE Transactions on Computers}, volume = {53}, number = {6}, issn = {00189340}, year = {2004}, pages = {641652}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.3}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs IS  6 SN  00189340 SP641 EP652 EPD  641652 A1  Youssef G. Saab, PY  2004 KW  Bisection KW  partitioning KW  iterative improvement KW  graph KW  hypergraph. VL  53 JA  IEEE Transactions on Computers ER   
Abstract—Partitioning is a fundamental problem in diverse fields of study such as data mining, parallel processing, and the design of VLSI circuits. A new approach to partition graphs and hypergraphs is introduced. This new approach combines local and global sampling, clustering, and Tabu Search in a multilevel partitioning algorithm (TPART). TPART was implemented in a C program and compared to many stateoftheart partitioning algorithms using a wide variety of benchmarks. TPART consistently performs well on the various benchmarks used and in comparison with other partitioning algorithms. TPART has a reasonably fast running time and it can produce a high quality partition of a graph of 262,144 nodes and 524,286 edges in less than 2 minutes CPU times on a Compaq Alpha DS20E 67/667 MHZ machine with 1GB of main memory.
[1] B. Hendrickson and R. Leland, An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations SIAM J. Scientific Computing, vol. 16, no. 2, pp. 452469, 1995.
[2] C. Alpert and A. Kahng, Recent Directions in Netlist Partitioning: A Survey IntegrationThe VLSI J., vol. 19, nos. 12, pp. 181, 1995.
[3] F.M. Johannes, Partitioning of VLSI Circuits and Systems Proc. Design Automation Conf., pp. 8387, 1996.
[4] C. Ding, H. Xiaofeng, Z. Hongyuan, G. Ming, and H. Simon, A MinMax Cut Algorithm for Graph Partitioning and Data Clustering Proc. IEEE Int'l Conf. Data Mining, pp. 107114, 2001.
[5] B.W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs Bell System Technical J., vol. 49, pp. 291307, Feb. 1970.
[6] C. Fiduccia and R. Mattheyses, A LinearTime Heuristics for Improving Network Partitions Proc. 19th Design Automation Conf., pp. 175181, Jan. 1982.
[7] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. New York: W.H. Freeman, 1979.
[8] T. Bui and C. Jones, Finding Good Approximate Vertex and Edge Partitions Is NPHard Information Processing Letters, vol. 42, pp. 153159, 1992.
[9] R. Battiti and A. Bertossi, Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning IEEE Trans. Computers, vol. 48, no. 4, pp. 361385, Apr. 1999.
[10] Y.G. Saab, ”A Fast and Robust Network Bisection Algorithm,” IEEE Trans. Computers, vol. 44, no. 7, July 1995.
[11] Y. Saab, A New 2Way MultiLevel Partitioning Algorithm VLSI Design J., vol. 11, no. 3, pp. 301310, 2000.
[12] G. Karypis, R. Aggarwal, V. Kumar, and S. Shekar, Multilevel Hypergraph Partitioning: Applications in VLSI Domain Proc. ACM/IEEE Design Automation Conf., 1997.
[13] C.J. Alpert, J.H. Huang, and A.B. Kahng, Multilevel Circuit Partitioning Proc. Design Automation Conf., pp. 530533, 1997.
[14] J. Cong, H.P. LI, S.K. Lim, T. Shibuya, and D. Xu, Large Scale Circuit Partitioning with Loose/Stable Net Removal and Signal Flow Based Clustering Proc. Int'l Conf. ComputerAided Design, pp. 441446, 1997.
[15] M. Lee and Y. Kim, "PatchODMRP: An Ad Hoc Multicast Routing Protocol," Proc. 15th Int'l Conf. Information Networking (ICOIN 2001), IEEE CS Press, Los Alamitos, Calif., 2001, pp. 537543.
[16] L.W. Hagen, D.J.H. Huang, and A.B. Kahng, On Implementation Choices for Iterative Improvement Partitioning Algorithms IEEE Trans. ComputerAided Design, vol. 16, no. 10, pp. 11991205, 1997.
[17] T.N. Bui and B.R. Moon, Genetic Algorithm and Graph Partitioning IEEE Trans. Computers, vol. 45, no. 7, pp. 841855, July 1996.
[18] D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning Operations Research, vol. 37, pp. 865892, Nov.Dec. 1989.
[19] T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, Graph Bisection Algorithm with Good Average Case Behavior Combinatorica, vol. 7, no. 2, pp. 171191, 1987.
[20] B. Monien and R. Diekmann, A Local Graph Partitioning Heuristic Meeting Bisection Bounds Proc. Eighth SIAM Conf. Parallel Processing for Scientific Computing, 1997.
[21] I. Duff, R. Grimes, and J. Lewis, Sparse Matrix Test Problems ACM Trans. Math. Software, vol. 15, no. 1, pp. 114, 1989.
[22] C. Alpert, The ISPD98 Circuit Benchmarks Suite Proc. Physical Design Workshop, pp. 8085, 1998.
[23] B. Hendrickson and R. Leland, The Chaco User's Guide Technical Report SAND942692, SANDIA Nat'l Laboratories, Albuquerque, N.M., 1994.
[24] G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs Technical Report 95035, Dept. of Computer Science Univ. of Minnesota, 1995.
[25] F. Pellegrini and J. Roman, Scotch: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs Proc. European Int'l Conf. High Performance Computing and Networking (HPCN '96), pp. 493498, Apr. 1996.
[26] R. Preis and R. Diekmann, The Party Partitioning Library, User Guide Technical Report TRRSFB96024, Univ. of Paderborn, Germany, 1996.
[27] S. Dutt and W. Deng, VLSI Circuit Partitioning by ClusterRemoval Using Iterative Improvement Techniques Proc. Int'l Conf. ComputerAided Design, pp. 194200, 1996.