A general framework for vertex orderings, with applications to netlist clustering

We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with highest attraction to the existing ordering. Variant choices for the attraction function allow our framework to subsume many graph traversals and clustering objectives from the literature. The DP-RP method of [3] is then applied to optimally split the ordering into a k-way clustering. Our approach is adaptable to user-specied cluster size constraints. Experimental results for clustering and multi-way partitioning are encouraging.

• Type: Conference
• Year: 1994
• Where: ICCAD
• Authors: Charles J. Alpert, Andrew B. Kahng
• Keywords: Hardware, ICCAD 1994, K-way Clustering, Netlist Clustering, Vertex Orderings