Circuit clustering using graph coloring

Authors:
Amit Singh;Malgorzata Marek-Sadowska
Affiliations:
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA;Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Venue:
ISPD '99 Proceedings of the 1999 international symposium on Physical design
Year:
1999

Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
On area/depth trade-off in LUT-based FPGA technology mapping

DAC '93 Proceedings of the 30th international Design Automation Conference
A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design

DAC '93 Proceedings of the 30th international Design Automation Conference
Exact coloring of real-life graphs is easy

DAC '97 Proceedings of the 34th annual Design Automation Conference
A new approach to effective circuit clustering

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
When clusters meet partitions: new density-based methods for circuit decomposition

EDTC '95 Proceedings of the 1995 European conference on Design and Test
Combining problem reduction and adaptive multistart: a new technique for superior iterative partitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Circuit clustering using a stochastic flow injection method

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On the acceleration of flow-oriented circuit clustering

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Exploiting hierarchy and structure to efficiently solve graph coloring as SAT

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design

Hi-index	0.00