Partitioning a network into n pieces with a time-efficient net cost function

Authors:
Paul Stravers
Affiliations:
Delft University of Technology
Venue:
EURO-DAC '91 Proceedings of the conference on European design automation
Year:
1991

Citing 1
Cited 1

A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

A timing driven N-way chip and multi-chip partitioner

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the generalization of the Fiduccia-Mattheyses linear time bi-partitioning algorithm to a linear time n-partitioning algorithm. It uses a new heuristic cost function to evaluate the cost of arbitrarily large spanning trees in O(log n) time. Practical experiments show good results.