A fast and high quality multilevel scheme for partitioning irregular graphs

SIAM Journal of Scientific Computing

Volumn 20, Issue 1, 1998, Pages 359-392

  Karypis, George ^a   Kumar, Vipin ^a  

^a University of Minnesota   (United States)

Author keywords

Fill reducing orderings; Finite element computations; Graph partitioning; Parallel computations

Indexed keywords

FILL-REDUCING ORDERINGS; KERNIGHAN-LIN (KL) ALGORITHM;

ALGORITHMS; FINITE ELEMENT METHOD; HEURISTIC METHODS; LINEAR PROGRAMMING; VLSI CIRCUITS;

GRAPH THEORY;

EID: 0032131147     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827595287997     Document Type: Article

References (2)

1. S. T. BARNARD AND H. SIMON, A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes, in Proc. 7th SIAM Conf. Parallel Processing for Scientific Computing, 1995, pp. 627-632.
2. S. T. BARNARD AND H. D. SIMON, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, in Proc. 6th SIAM Conf. Parallel Processing for Scientific Computing, 1993, pp. 711-718.