A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design

In this paper, we present a bottom-up clustering algorithm based on recursive collapsing of small cliques in a graph. The sizes of the small cliques are derived using random graph theory. This clustering algorithm leads to a natural parallel implementation in which multiple processors are used to id...

Full description

Saved in:
Bibliographic Details
Published in:30th ACM/IEEE Design Automation Conference pp. 755 - 760
Main Authors: Cong, Jason, Smith, M'Lissa
Format: Conference Proceeding
Language:English
Published: New York, NY, USA ACM 01.07.1993
Series:ACM Conferences
Subjects:
ISBN:9780897915779, 0897915771
ISSN:0738-100X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first