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

DOI10.1109/31.57601zbMATH Open0733.94027OpenAlexW2170314243MaRDI QIDQ3360809FDOQ3360809

Authors: 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

Recommendations

• A fast hypergraph min-cut algorithm for circuit partitioning
• Efficient algorithms for generalized cut‐trees
• Min-cut partitioning on underlying tree and graph structures
• Recent directions in netlist partitioning: a survey
• scientific article; zbMATH DE number 139787

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)

Cited In (6)

• A fast hypergraph min-cut algorithm for circuit partitioning
• Finding part-machine families using graph partitioning techniques
• Approximation techniques for hypergraph partitioning problems
• Modeling hypergraphs by graphs with the same mincut properties
• Hypergraph Cuts with General Splitting Functions
• Min-cut partitioning on underlying tree and graph structures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360809)