Andrew E. Caldwell
Andrew B. Kahng
Igor L. Markov
- 1.C.J. Alpert, "Partitioning Benchmarks for VLSI CAD Community", http ://vls ~cad. cs. ucla. edu/~ cheese/benchmarks, htmlGoogle Scholar
- 2.C. J. Alpert, "The ISPD-98 Circuit Benchmark Suite", Proc. ACM/IEEE International Symposium on Physical Design, April 98, pp. 80-85. See errata at http ://vls ~cad. cs. ucla. edu/~ cheese/errata, html Google ScholarDigital Library
- 3.C.J. Alpert, J.-H. Huang and A. B. Kahng,"Multilevel Circuit Partitioning", ACM/IEEE Design Automation Conference, pp. 530-533. Google ScholarDigital Library
- 4.C.J. Alpert and A. B. Kahng, "Recent Directions in Netlist Partitioning: A Survey", Integration, 19(1995) 1-81. Google ScholarDigital Library
- 5.J. A. Davis, V. K. De and J. D. Meindl, "A Stochastic Wire-Length Distribution for Gigascale Integration (GSI) - Part I: Derivation and Validation", IEEE Transactions on Electron Devices, vol. 45(3), pp. 580-589.Google ScholarCross Ref
- 6.A. E. Dunlop and B. W. Kernighan, "A Procedure for Placement of Standard Cell VLSI Circuits", IEEE Transactions on Computer- Aided Design 4(1) (1985), pp. 92-98Google ScholarDigital Library
- 7.S. Dutt and W. Deng, "VLSI Circuit Partitioning by Cluster-Removal Using Iterative Improvement Techniques", Proc. IEEE International Conference on Computer-Aided Design, 1996, pp. 194-200 Google ScholarDigital Library
- 8.C. M. Fiduccia and R. M. Mattheyses, "A Linear Time Heuristic for Improving Network Partitions", Proc. ACM/IEEE Design Automation Conference, 1982, pp. 175-181. Google ScholarDigital Library
- 9.M. R. Garey and D. S. Johnson, "Computers and Intractability, a Guide to the Theory of NP-completeness", W. H. Freeman and Company: New York, 1979, pp. 223 Google ScholarDigital Library
- 10.M.K. Goldberg and M. Burstein, "Heuristic Improvement Technique for Bisection of VLSI Networks", IEEE Transactions on Computer- Aided Design, 1983, pp. 122-125.Google Scholar
- 11.S. Hauck and G. Borriello, "An Evaluation of Bipartitioning Techniques", IEEE Transactions on Computer-Aided Design 16(8) (1997), pp. 849-866. Google ScholarDigital Library
- 12.D. J. Huang and A. B. Kahng, "Partitioning-Based Standard Cell Global Placement with an Exact Objective", Proc. ACM/IEEE International Symposium on Physical Design, 1997, pp. 18-25. Google ScholarDigital Library
- 13.B. W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs", Bell System Tech. Journal 49 (1970), pp. 291- 307.Google Scholar
- 14.G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar, "Multilevel Hypergraph Partitioning: Applications in VLSI Design", Proc. ACM/IEEE Design Automation Conference, 1997, pp. 526-529. Google ScholarDigital Library
- 15.B. Landman and R. Russo, "On a Pin Versus Block Relationship for Partitioning of Logic Graphs", IEEE Transactions on Computers C- 20(12) (1971), pp. 1469-1479.Google ScholarDigital Library
- 16.E R. Suaris and G. Kedem, "Quadrisection: A New Approach to Standard Cell Layout", Proc. IEEE/ACM International Conference on Computer-Aided Design, 1987, pp. 474-477.Google Scholar
- 17.D. Sylvester and K. Keutzer, "Getting to the Bottom of Deep- Submicron", to appear in Proc. IEEE Intl. Conference on Computer- Aided Design, November 1998. Google ScholarDigital Library
Index Terms
- Hypergraph partitioning with fixed vertices
Recommendations
Multilevel hypergraph partitioning: application in VLSI domain
DAC '97: Proceedings of the 34th annual Design Automation ConferenceIn this paper, we present a new hypergraph partitioning algorithmthat is based on the multilevel paradigm. In the multilevel paradigm,a sequence of successively coarser hypergraphs is constructed. Abisection of the smallest hypergraph is computed and it ...
Nonseparating Cycles Avoiding Specific Vertices
Thomassen proved that every k+3-connected graph G contains an induced cycle C such that G-VC is k-connected, establishing a conjecture of Lovász. In general, one could ask the following question: For any positive integers k,l, does there exist a ...
Boundary vertices in graphs
The distance d(u, v) between two vertices u and v in a nontrivial connected graph G is the length of a shortest u-v path in G. For a vertex v of G, the eccentricity e(v) is the distance between v and a vertex farthest from v. A vertex v of G is a ...
Comments