scientific article; zbMATH DE number 1329958

MaRDI QIDQ4258168zbMATH OpenFDO

Authors Jian-Jun Xue, Xiaohu Yu

Publication date 20 February 2000

zbMATH Keywords

graph partitioningneural networks

Mathematics Subject Classification ID

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

Recommendations

• An approximation algorithm for graph partitioning via deterministic annealing neural network
• Circuit partitioning using mean field annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• An improved neural computing algorithm for the m-way graph partitioning problem

Cited in

(5)

• \(K\)-way neural network graph partitioning with separator vertices
• Automorphism partitioning with neural networks
• An approximation algorithm for graph partitioning via deterministic annealing neural network
• scientific article; zbMATH DE number 4201664 (Why is no real title available?)
• An improved neural computing algorithm for the m-way graph partitioning problem

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 Q4258168)