Graph partitioning with the party library: Helpful-sets in practice

Proceedings - Symposium on Computer Architecture and High Performance Computing

Volumn , Issue , 2004, Pages 198-205

  Monien, Burkhard ^a   Schamberger, Stefan ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Helpful sets; Heuristic graph partitioning; Recursive bisection

Indexed keywords

HELPFUL-SETS; HEURISTIC GRAPH PARTITIONING; PERMUTATION; RECURSIVE BISECTIONS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FINITE ELEMENT METHOD; HEURISTIC METHODS; PROBLEM SOLVING;

GRAPH THEORY;

EID: 16244383162     PISSN: 15506533     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SBAC-PAD.2004.18     Document Type: Conference Paper

References (14)

1. R. Diekmann, B. Monien, and R. Preis. Using helpful sets to improve graph bisections. Volume 21 of DIMACS Series in Discr. Math. and Theo. Comp. Sci., pages 57-73, 1995.
2. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In ACM IEEE 19th Design Autom. Conf. Proc., pages 175-181, 1982.
3. B. Hendrickson and R. Leland. A multi-level algorithm for partitioning graphs. In Proc. of Supercomputing'95, 1995.
4. J. Hromkovic and B. Monien. The bisection problem for graphs of degree 4. Proc. of Math. Found. of Comp. Sci. (MFCS '91), LNCS, 520:211-220, 1991.
5. G. Karypis and V. Kumar. Analysis of multilevel graph partitioning. In Proc. of Supercomputing'95. 1995.
6. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. J. of Par. and Dist. Comp., 48:96 -129, 1998.
7. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. on Sci. Comp., 20(1):359-392, 1999.
8. B. W. Kernighan and S. Lin. An efficient heuristic for partitioning graphs. Bell Systems Tech. J., 49:291-308, 1970.
9. B. Monien, R. Preis. Upper Bounds on the Bisection Width of 3-and 4-regular Graphs. 26th Int. Symp. on Math. Found. of Comp. Sci. MFCS 2001, LNCS, 2136:524-536
10. A. Pothen, H. D. Simon, and K. P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. on Matrix Analysis and Applications, 11(3):430-452, 1990.
11. R. Preis. Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. LNCS, 1563:259-269, 1999.
12. S. Schamberger. Improvements to the helpful-set heuristic and a new evaluation scheme for graphs-partitioners. In Proc. of ICCSA, LNCS, 2667:49-59, 2003.
13. H. Simon and S. Teng. How good is recursive bisection. SIAM J. on Sci. Comp., 18(5): 1436-1445, 1997.
14. C. Walshaw and M. Cross. Mesh partitioning: A multilevel balancing and refinement algorithm. SIAM J. on Sci. Comp., 22(1):63-80, 2000.