483

Introduction to Parallel Computing; Design and Analysis of Algorithms. Benjamin/Cummings
– V Kumar, A Grama, A Gupta, G Karypis
 1994

497

Computer Solution of Large Sparse Positive Definite S~:stems
– J A George, J W H Liu
 1981

136

Modification of the minimumdegree algorithm by multiple elimination
– J Liu
 1985

442

A multilevel algorithm for partitioning graphs
– B Hendrickson, R Leland
 1995

277

A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems
– Stephen T. Barnard, Horst D. Simon
 1994

475

Parallel Multilevel kway Partitioning Scheme for Irregular Graphs
– George Karypis, Vipin Kumar
 1996

70

The Chaco User’s Guide,” Version 1.0
– B Hendrickson, R Leland
 1993

1039

An efficient heuristic procedure for partitioning graphs, Bell System
– B W Kernighan, S Lin
 1970

70

A heuristic for reducing fill in sparse matrix factorization
– T Bui, C Jones
 1993

251

A column approximate minimum degree ordering algorithm
– Timothy A. Davis, et al.
 2000

89

Analysis of multilevel graph partitioning
– George Karypis, Vipin Kumar
 1995

115

Parallel algorithms for sparse linear systems
– M T Heath, E Ng, B W Peyton
 1991

789

A fast and high quality multilevel scheme for partitioning irregular graphs
– George Karypis, Vipin Kumar
 1998

22

A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes
– S T Barnard, H D Simon
 1995

28

Finding clusters in VLSI circuits
– J Garbers, H J Promel, A Steger

17

Graph contraction and physical optimization methods: a qualitycost tradeoff for mapping data on parallel computers
– N. Mansour, R. Ponnusamy, A. Choudhary, G. C. Fox
 1993

304

Mattheyses, A linear time heuristic for improving network partitions
– C M Fiduccia, R M
 1982

483

Partitioning sparse matrices with eigenvectors of graphs
– A Pothen, H Simon, KP Liou
 1990

90

A unified geometric approach to graph separators
– G L Miller, SH Teng, S A Vavasis
 1991
