A linear-time heuristic for improving network partitions

Proceedings - Design Automation Conference

Volumn Part F130197, Issue , 1988, Pages 241-247

  Fiduccia, C M ^a   Mattheyses, R M ^a  

^a GE GLOBAL RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTER AIDED DESIGN; CYTOLOGY; ITERATIVE METHODS;

COMPUTATION TIME; EFFICIENT DATA STRUCTURES; LINEAR TIME; MIN-CUT; NETWORK PARTITIONS; PARTITIONING NETWORKS;

CELLS;

EID: 84901784784     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62882.62910     Document Type: Conference Paper

References (5)

1. M.A. Breuer, "Min-Cut Placement," J. of Design and Fault-Tolerant Computing, Vol. 1, number 4, Oct. 1977, pp. 343-362.
2. th Design Automation Conference, New Orleans, 1977, pp. 284-290.
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. th Design Automation Workshop, Dallas, June 1979, pp. 57-62.
5. th Design Automation Conference, Minneapolis, June 1980, pp. 458-464.