Partitioning, Spectra and Linear Programming

This publication has 5 references indexed in Scilit:

• An Algorithm for Partitioning the Nodes of a Graph
  SIAM Journal on Algebraic Discrete Methods, 1982
• Area-time complexity for VLSI
  Published by Association for Computing Machinery (ACM) ,1979
• The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
  Published by Springer Nature ,1975
• A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large, sparse, real symmetric matrices
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1974
• Lower Bounds for the Partitioning of Graphs
  IBM Journal of Research and Development, 1973