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

MaRDI QIDQ3377353zbMATH OpenFDO

Authors Jiahai Wang

Publication date 21 March 2006

zbMATH Keywords

maximum neural networknonlinear self-feedbackVLSI circuit design

Mathematics Subject Classification ID

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

Recommendations

• Graph partitioning using homotopy based fast annealed neural networks
• 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

Cited in

(4)

• Performance of a neural network method with set partitioning
• \(K\)-way neural network graph partitioning with separator vertices
• An approximation algorithm for graph partitioning via deterministic annealing neural network
• Graph partitioning using homotopy based fast annealed neural networks

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)