An improved neural computing algorithm for the m-way graph partitioning problem

zbMATH Open1089.68115MaRDI QIDQ3377353FDOQ3377353

Authors: Jiahai Wang 

Publication date: 21 March 2006

Recommendations

• scientific article; zbMATH DE number 1329958
• scientific article; zbMATH DE number 4011955
• An approximation algorithm for graph partitioning via deterministic annealing neural network
• scientific article; zbMATH DE number 4201664
• \(K\)-way neural network graph partitioning with separator vertices

zbMATH Keywords

VLSI circuit designmaximum neural networknonlinear self-feedback

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Cited In (2)

• An approximation algorithm for graph partitioning via deterministic annealing neural network
• Performance of a neural network method with set partitioning

This page was built for publication: An improved neural computing algorithm for the \(m\)-way graph partitioning problem

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