A computational study of graph partitioning

This publication has 16 references indexed in Scilit:

• An efficient eigenvector approach for finding netlist partitions
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
• Optimal linear labelings and eigenvalues of graphs
  Discrete Applied Mathematics, 1992
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
  Operations Research, 1989
• A New Heuristic for Partitioning the Nodes of a Graph
  SIAM Journal on Discrete Mathematics, 1988
• Matrix Analysis
  Published by Cambridge University Press (CUP) ,1985
• λ1, Isoperimetric inequalities for graphs, and superconcentrators
  Journal of Combinatorial Theory, Series B, 1985
• An Algorithm for Partitioning the Nodes of a Graph
  SIAM Journal on Algebraic Discrete Methods, 1982
• The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
  Published by Springer Nature ,1975
• Lower Bounds for the Partitioning of Graphs
  IBM Journal of Research and Development, 1973
• An Efficient Heuristic Procedure for Partitioning Graphs
  Bell System Technical Journal, 1970