Efficient multiple-way network-partitioning algorithm

DOI10.1016/0010-4485(93)90084-2zbMATH Open0770.94009OpenAlexW2037949747MaRDI QIDQ1802265FDOQ1802265

Yanyan Li

Publication date: 8 August 1993

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4485(93)90084-2

zbMATH Keywords

cutsetscircuit partitioningbalance costbalance gainelectronics-design automationKernigham-Lin algorithmmultiple-way network-partitioning problemSanchis algorithmsize balances

Mathematics Subject Classification ID

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

Cited In (2)

• The optimal partitioning of networks
• Multiterminal net assignments by scatter search

   Recommendations

• A methodology for multicriteria network partitioning 👍 👎
• A fast and robust network bisection algorithm 👍 👎
• Recent directions in netlist partitioning: a survey 👍 👎
• Two-stage \(m\)-way graph partitioning 👍 👎
• A genetic approach for network partitioning 👍 👎

This page was built for publication: Efficient multiple-way network-partitioning algorithm

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