On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint

This publication has 21 references indexed in Scilit:

• New spectral methods for ratio cut partitioning and clustering
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
• Partitioning of unstructured problems for parallel processing
  Computing Systems in Engineering, 1991
• Partitioning Sparse Matrices with Eigenvectors of Graphs
  SIAM Journal on Matrix Analysis and Applications, 1990
• A graph partitioning algorithm by node separators
  ACM Transactions on Mathematical Software, 1989
• A simple and efficient automatic fem domain decomposer
  Computers & Structures, 1988
• A New Heuristic for Partitioning the Nodes of a Graph
  SIAM Journal on Discrete Mathematics, 1988
• Graph bisection algorithms with good average case behavior
  Combinatorica, 1987
• An Algorithm for Partitioning the Nodes of a Graph
  SIAM Journal on Algebraic Discrete Methods, 1982
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
  SIAM Journal on Numerical Analysis, 1978
• The Optimal Partitioning of Graphs
  SIAM Journal on Applied Mathematics, 1976