Efficient algorithm for graph-partitioning problem using a problem transformation method

DOI10.1016/0010-4485(89)90159-0MaRDI QIDQ583241zbMATH OpenOpenAlexFDO

Authors Jianyong Qiao, Sumit K. Garg

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0010-4485(89)90159-0

zbMATH Keywords

max-cut problemcircuit partitioningelectronic design automationk-way graph- partitioning problemKernighan-Lin algorithmmaximum cutsetuniform k- way partitioning problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Computational Science - ICCS 2004
• New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• scientific article; zbMATH DE number 4094840
• Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic

Cited in

(1)

• Multi-way graph partition by stochastic probe

This page was built for publication: Efficient algorithm for graph-partitioning problem using a problem transformation method

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