|
771
|
An efficient heuristic procedure for partitioning graphs, The Bell Syst
– Kernighan, Lin
- 1970
|
|
364
|
Combinatorical algorithms for integrated circuit layout. Applicable Theory
– Lengauer
- 1990
|
|
260
|
Mattheyses, “A linear time heuristic for improving network partitions
– Fiduccia, M
- 1982
|
|
237
|
Users' guide for the Harwell-Boeing sparse matrix collection (release I).Technical Report TR/PA/92/86, Research and Technology Division, Boeing Computer Services
– Duff, Grimes, et al.
- 1992
|
|
139
|
The role of elimination trees in sparse factorization
– Liu
- 1990
|
|
121
|
The MasPar MP-1 Architecture
– Blank
- 1990
|
|
117
|
Parallel algorithms for sparse linear systems
– Heath, Ng, et al.
- 1991
|
|
110
|
Interior point methods for linear programming: Computational state of the art
– Lustig, Marsten, et al.
- 1994
|
|
108
|
The evolution of the minimum degree ordering algorithm
– George, Liu
- 1989
|
|
58
|
Sparse Cholesky Factorization on a local memory multiprocessor
– George, Heath, et al.
- 1988
|
|
39
|
Progress in sparse matrix methods for large linear systems on vector supercomputers
– Ashcraft, Grimes, et al.
- 1987
|
|
36
|
Highly Parallel Sparse Cholesky Factorization
– Gilbert, Schreiber
- 1992
|
|
33
|
An automatic nested dissection algorithm for irregular finite element problems
– George, Liu
- 1978
|
|
25
|
Efficient partitioning of sequences
– Olstad, Manne
- 1995
|
|
24
|
Sparse matrix computations on parallel processor arrays
– Ogielski, Aiello
- 1993
|
|
20
|
A new heuristic for partitioning the nodes of a graph
– ER, Vannelli, et al.
- 1988
|
|
19
|
Efficient parallel solutions of large sparse SPD systems on distributed-memory multiprocessors
– Sun
- 1992
|
|
16
|
Sparse Cholesky factorization on a Multiprocessor
– Zmijewski
- 1987
|
|
8
|
Computing the minimum ll-in is NP-complete
– Yannakakis
- 1981
|
|
6
|
The multifrontal solution of indenite sparse symmetric linear systems
– Du, Reid
- 1983
|
|
4
|
Solution of large scale linear programs: A review of hardware, software, and algorithmic issues
– Levkovitz, Mitra
- 1992
|
|
3
|
Solving Large Scale Linear Programming Problems Using an Interior Point Method on a Massively Parallel
– Hafsteinsson, Levkovitz, et al.
- 1993
|
|
2
|
EOEcient matrix multiplication on SIMD computers
– Bjrstad, Manne, et al.
- 1992
|
|
2
|
Sparse matrix calculations on
– Dave, Duff
- 1987
|
|
2
|
Sparse LU factorization on massively parallel SIMD computers
– Kratzer
- 1992
|
|
2
|
A vector/parallel implementation of the multifrontal method for sparse symmetric positive definite linear systems
– Yang
- 1990
|
|
1
|
How well can a graph be n-colored
– Vitnyi
- 1981
|
