Network partitioning into tree hierarchies

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Network partitioning into tree hierarchies

Full text

Pdf (73 KB)

Source

Annual ACM IEEE Design Automation Conference archive
Proceedings of the 33rd annual Design Automation Conference table of contents

Las Vegas, Nevada, United States

Pages: 477 - 482

Year of Publication: 1996

ISBN:0-89791-779-0

Authors

Ming-Ter Kuo	Department of Computer Science and Engineering, University of California, San Diego, La Jolla, California
Lung-Tien Liu	AT&T Bell Laboratories, Murray Hill, New Jersey
Chung-Kuan Cheng	Department of Computer Science and Engineering, University of California, San Diego, La Jolla, California

Sponsors

IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 7, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/240518.240609 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	C. M. Fiduccia , R. M. Mattheyses, A linear-time heuristic for improving network partitions, Papers on Twenty-five years of electronic design automation, p.241-247, June 1988 [doi>10.1145/62882.62910]
	2	Thomas Lengauer, Combinatorial algorithms for integrated circuit layout, John Wiley & Sons, Inc., New York, NY, 1990
	3	Lung-Tien Liu , Ming-Ter Kuo , Shih-Chen Huang , Chung-Kuan Cheng, A gradient method on the initial partition of Fiduccia-Mattheyses algorithm, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.229-234, November 05-09, 1995, San Jose, California, United States
	4	L. A. Sanchis, Multiple-Way Network Partitioning, IEEE Transactions on Computers, v.38 n.1, p.62-81, January 1989 [doi>10.1109/12.8730]
	5	Gopalakrishnan Vijayan, Generalization of Min-Cut Partitioning to Tree Structures and its Applications, IEEE Transactions on Computers, v.40 n.3, p.307-314, March 1991 [doi>10.1109/12.76407]

CITED BY 3

	Andrew B. Kahng, Futures for partitioning in physical design (tutorial), Proceedings of the 1998 international symposium on Physical design, p.190-193, April 06-08, 1998, Monterey, California, United States
	H. Krupnova , C. Rabedaoro , G. Saucier, Synthesis and floorplanning for large hierarchical FPGAs, Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays, p.105-111, February 09-11, 1997, Monterey, California, United States
	Ming-er Kuo , Chung-Kuan Cheng, A network flow approach for hierarchical tree partitioning, Proceedings of the 34th annual conference on Design automation, p.512-517, June 09-13, 1997, Anaheim, California, United States