A Gomory-Hu cut tree representation of a netlist partitioning problem

DOI10.1109/31.57601zbMath0733.94027OpenAlexW2170314243MaRDI QIDQ3360809

Anthony Vannelli, Scott W. Hadley

Publication date: 1990

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/31.57601

zbMATH Keywords

weighted undirected graphcut treedesign of VLSI layoutshypergraph representation of netlistsnetlist partitions in VLSI design

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Approximation techniques for hypergraph partitioning problems ⋮ Hypergraph Cuts with General Splitting Functions ⋮ Modeling hypergraphs by graphs with the same mincut properties ⋮ Finding part-machine families using graph partitioning techniques

This page was built for publication: A Gomory-Hu cut tree representation of a netlist partitioning problem