Spectral partitioning with multiple eigenvectors

Discrete Applied Mathematics

Volumn 90, Issue 1-3, 1999, Pages 3-26

  Alpert, Charles J ^a   Kahng, Andrew B ^b   Yao, So Zen ^c  

^a IBM AUSTIN RESEARCH LABORATORY   (United States)

^b University of California   (United States)

^c CLK Computer Aided Design Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002334967     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00083-3     Document Type: Article

References (42)

1. C.J. Alpert, A.B. Kahng, Multi-way partitioning via spacefilling curves and dynamic programming, in: Proceedings of the ACM/IEEE Design Automation Conference, 1994, pp. 652-657.
2. C.J. Alpert, A.B. Kahng, Multi-way partitioning via geometric embeddings, orderings, and dynamic programming, IEEE Trans. CAD 14 (1995) 1342-1358.
3. C.J. Alpert, A.B. Kahng, A general framework for vertex orderings, with applications to netlist clustering, in: IEEE International Conference on Computer-Aided Design, 1994, pp. 63-67.
4. C.J. Alpert, A.B. Kahng, Recent developments in netlist partitioning: a survey, Integration: the VLSI J. 19 (1995) 1-81.
5. C.J. Alpert, S.-Z. Yao, Spectral partitioning: the more eigenvectors the better, in: Proceedings of the ACM/IEEE Design Automation Conference, 1995, pp. 195-200.
6. K.S. Arun, V.B. Rao, New heuristics and lower bounds for graph partitioning, in: Proceedings of the IEEE International Symposium on Circuits and Systems, 1991, pp. 1172-1175.
7. S.T. Barnard, H.D. Simon, A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience 6 (1994) 101-117.
8. E.R. Barnes, An algorithm for partitioning the nodes of a graph, Siam J. Alg. Disc. Meth. 3 (1982) 541-549.
9. E.R. Barnes, A. Vannelli, J.Q. Walker, An new heuristic for partitioning the nodes of a graph, Siam J. Dicrete Math. 3 (1988) 299-305.
10. M. Carter, The indefinite zero-one quadratic problem. Discrete Appl. Math. 7 (1984) 23-44.
11. P.K. Chan, M.D.F. Schlag, J. Zien, Spectral k-way ratio cut partitioning and clustering, IEEE Trans. CAD (1994) 1088-1096.
12. H.R. Charney, D.L. Plato, Efficient partitioning of components, in: Proceedings of the Fifth Design Automation Workshop, 1968, pp. 16-0-16-21.
13. J. Cullum, W.E. Donath, P. Wolfe, The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices, Mathematical Programming Study vol. 3, North-Holland, Amsterdam, 1975, pp. 35-55.
14. C. Delorme, S. Poljak, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Discrete Math. 111 (1991) 145-156.
15. C. Delorme, S. Poljak, Laplacian eigenvalues and the maximum cut problem, Math. Program. 62 (1993) 557-574.
16. W.E. Donath, Logic partitioning, in: Physical Design Automation of VLSI Systems, Benjamin/ Cummings, 1988, pp. 65-86.
17. W.E. Donath, A.J. Hoffman, Lower bounds for the partitioning of graphs, IBM J. Res. Dev. 17 (1973) 420-425.
18. J. Falkner, F. Rendl, H. Wolkowicz, A computational study of graph partitioning, Math. Programm. 66 (1994) 211-239.
19. M. Fiedler, Algebraic connectivity of graphs, Czech. Math. J. 23 (1973) 298-305.
20. J. Frankle, R.M. Karp, Circuit placements and cost bounds by eigenvector decomposition, in: Proceedings of the IEEE International Conference on Computer-Aided Design, 1986, pp. 414-417.
21. A. Frieze, M. Jerrum, Improved approximation algorithms for max k-cut and max bisection, in: Proceedings of the 4th International IPCO Conference 920, 1995, pp. 1-13.
22. J. Garbers, H.J. Promel, A. Steger, Finding clusters in VLSI circuits, in: Proceedings of the IEEE International Conference on Computer-Aided Design, 1990, pp. 520-523.
23. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995) 1115-1145.
24. S. Guattery, G.L. Miller, On the performance of spectral graph partitioning methods, in: Proceedings of the ACM/SIAM Symposium on Discrete Algorithms, 1995, pp. 233-242.
25. L. Hagen, A.B. Kahng, A new approach to effective circuit clustering, in: Proceedings of the IEEE International Conference on Computer-Aided Design, 1992, pp. 422-427.
26. L. Hagen, A.B. Kahng, New spectral methods for ratio cut partitioning and clustering, IEEE Trans. CAD 11 (1992) 1074-1085.
27. S.W. Hadley, B.L. Mark, A. Vannelli, An efficient eigenvector approach for finding netlist partitions, IEEE Trans. CAD 11 (1992) 885-892.
28. K.M. Hall, An r-dimensional quadratic placement algorithm, Mngnt. Sci. 17 (1970) 219-229.
29. M. Hanan, P.K. Wolff, B.J. Agule, A study of placement techniques, J. Des. Automat. and Fault-Tolerant Comput. 2 (1978) 28-61.
30. B. Hendrickson, R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Scci. Comput. 16 (1995) 452-69.
31. T.C. Hu, K. Moerder, Multiterminal flows in a hypergraph, in: VLSI Circuit Layout: Theory and Design, IEEE Press, New York, 1985, pp. 87-93.
32. E. Ihler, D. Wagner, F. Wagner, Modeling hypergraphs by graphs with the same mincut properties, Inform. Process. Lett. 45 (1993) 171-175.
33. T. Lengauer, Combinatorial algorithms for integrated circuit layout, Wiley-Teubner, New York, 1990.
34. B. Mohar, The Laplacian spectrum of graphs, in: Proceedings of the 6th Quadrennial International Conference on the Theory and Applications of Graphs, 1988, pp. 871-898.
35. L.T. Pillage, R.A. Rohrer, A quadratic metric with a simple solution scheme for initial placement, in: Proceedings of the ACM/IEEE Design Automation Conference, 1988, pp. 324-329.
36. S. Poljak, F. Rendl, Solving the max-cut problem using eigenvalues, Discrete Appl. Math. 62 (1995) 249-278.
37. A. Pothen, H.D. Simon, K.P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl. 11 (1990) 430-452.
38. F. Rendl, H. Wolkowicz, A projection technique for partitioning the nodes of a graph, Ann. Oper. Res. 58 (1995) 155-179.
39. B.M. Riess, K. Doll, F.M. Johannes, Partitioning very large circuits using analytical placement techniques, in: Proceedings of the ACM/IEEE Des Automation Conference, 1994, pp. 646-651.
40. D.S. Scott, LASO2 documentation, Technical Report, University of Texas, Austin, TX, 1980.
41. D.A. Spielman, S.-H. Teng, Spectral partitioning works: planar graphs and finite element meshes, Manuscript, 1996.
42. R.-S. Tsay, E.S. Kuh, A unified approach to partitioning and placement, IEEE Trans. Circuits Systems 38 (1991) 521-533.