ACM Home Page
Please provide us with feedback. Feedback
A linear-time heuristic for improving network partitions
Full text PdfPdf (768 KB)
Source Annual ACM IEEE Design Automation Conference archive
Papers on Twenty-five years of electronic design automation table of contents
Pages: 241 - 247  
Year of Publication: 1988
ISBN:0-89791-267-5
Authors
C. M. Fiduccia  General Electric, Research and Development Center, Schenectady, NY
R. M. Mattheyses  General Electric, Research and Development Center, Schenectady, NY
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 50,   Citation Count: 14
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/62882.62910
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
M A Breuer, "Min-Cut Placement, J. of Design and Fault- Tolerant Computing, Vol. I, number 4, Oct. 1977, pp. 343-362.
 
2
 
3
B.W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell System Technical Journal, Vol. 49, Feb. 1970, pp. 291-307.
4
5

CITED BY  14

Collaborative Colleagues:
C. M. Fiduccia: colleagues
R. M. Mattheyses: colleagues