scientific article; zbMATH DE number 139787

MaRDI QIDQ4028112zbMATH OpenFDO

Authors Fillia Makedon, S. Tragoudas

Publication date 28 March 1993

zbMATH Keywords

approximationhypergraphoptimal solutionpolynomial timemulticommodity flow problemcircuit partitioning problemsminimum net expansion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Circuits, networks (94C99) Hypergraphs (05C65)

Recommendations

• A fast hypergraph min-cut algorithm for circuit partitioning
• scientific article; zbMATH DE number 3891429
• Solution of one problem of optimal partition of the vertex set of a hypergraph
• Multicommodity flow approximation used for exact graph partitioning
• Min-cut partitioning on underlying tree and graph structures

Cited in

(1)

• A fast hypergraph min-cut algorithm for circuit partitioning

This page was built for publication:

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