A compact row storage scheme for Cholesky factors using elimination trees
ACM Transactions on Mathematical Software (TOMS)
Direct methods for sparse matrices
Direct methods for sparse matrices
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The analysis of a nested dissection algorithm
Numerische Mathematik
Remarks on implementation of O(n1/2τ) assignment algorithms
ACM Transactions on Mathematical Software (TOMS)
Some nested dissection order is nearly optimal
Information Processing Letters
Equivalent sparse matrix reordering by elimination tree rotations
SIAM Journal on Scientific and Statistical Computing
Modification of the minimum-degree algorithm by multiple elimination
ACM Transactions on Mathematical Software (TOMS)
On Algorithms for Obtaining a Maximum Transversal
ACM Transactions on Mathematical Software (TOMS)
A New Implementation of Sparse Gaussian Elimination
ACM Transactions on Mathematical Software (TOMS)
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Orderings for Parallel Sparse Symmetric Factorization
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor
A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor
A Round-Robin Parallel Partitioning Algorithm
A Round-Robin Parallel Partitioning Algorithm
ACM SIGNUM Newsletter
Computational Aspects of VLSI
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
Computing the block triangular form of a sparse matrix
ACM Transactions on Mathematical Software (TOMS)
Parallel direct solution of large sparse systems in finite element computations
ICS '93 Proceedings of the 7th international conference on Supercomputing
ICS '96 Proceedings of the 10th international conference on Supercomputing
A parallel formulation of interior point algorithms
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A partitioning algorithm for block-diagonal matrices with overlap
Parallel Computing
| Hi-index | 0.00 |
A heuristic graph partitioning scheme is presented to determine effective node separators for undirected graphs. An initial separator is first obtained from the minimum degree ordering, an algorithm designed originally to produce fill-reducing orderings for sparse matrices. The separator is then improved by an iterative strategy based on some known results from bipartite graph matching. This gives an overall practical scheme in partitioning graphs. Experimental results are provided to demonstrate the effectiveness of this heuristic algorithm on graphs arising from sparse matrix applications.