Improvements to the Helpful-Set Algorithm and a New Evaluation Scheme for Graph-Partitioners

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2669, Issue , 2003, Pages 49-59

  Schamberger, Stefan ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; LIBRARIES;

EVALUATION SCHEME; GRAPH PARTITIONING; IDENTICAL STRUCTURES; LOCAL REFINEMENT; MATCHING ALGORITHM; NON-DETERMINISM; SET ALGORITHM;

ALGORITHMS;

EID: 21144432938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44842-x_6     Document Type: Article

References (8)

1. R. Diekmann, B. Monien, and R. Preis. Using helpful sets to improve graph bisections. In D.F. Hsu, A.L. Rosenberg, and D. Sotteau, editors, Interconnection Networks and Mapping and Scheduling Parallel Computations, volume 21 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 57-73. AMS, 1995.
2. U. Elsner. Static and Dynamic Graph Partitioning. PhD thesis, Technische Universität Chemniz, 2001.
3. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In ACM IEEE Nineteenth Design Automation Conference Proceedings, pages 175-181, Los Alamitos, Ca., USA, Jun 1982. IEEE Computer Society Press.
4. B. Hendrickson and R. Leland. A multi-level algorithm for partitioning graphs. In Proceedings of Supercomputing'95, San Diego, CA, Dec 1995. ACM/IEEE.
5. J. Hromkovic and B. Monien. The bisection problem for graphs of degree 4 (configuring transputer systems). In A. Tarlecki, editor, Proceedings of Mathematical Foundations of Computer Science. (MFCS '91), volume 520 of LNCS, pages 211-220, Berlin, Germany, Sep 1991. Springer.
6. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359-392, Jan 1999.
7. B. W. Kernighan and S. Lin. An efficient heuristic for partitioning graphs. Bell Systems Technical Journal, 49:291-308, Feb 1970.
8. C. Walshaw and M. Cross. Mesh partitioning: A multilevel balancing and refinement algorithm. SIAM Journal on Scientific Computing, 22(1):63-80, 2000.