scientific article; zbMATH DE number 4201664

MaRDI QIDQ3350799zbMATH OpenFDO

Authors Laurent Hérault, Jean-Jacques Niez

Publication date 1989

zbMATH Keywords

combinatorial optimization problemsgraph K-partitioningneural networkNP-complete problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

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

Cited in

(15)

• Performance of a neural network method with set partitioning
• Hypergraph analysis of neural networks
• An adaptive, multiple restarts neural network algorithm for graph coloring
• \(K\)-way neural network graph partitioning with separator vertices
• Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
• Automorphism partitioning with neural networks
• Metaheuristics: A bibliography
• Smooth curve extraction by mean field annealing
• An improved neural computing algorithm for the m-way graph partitioning problem
• scientific article; zbMATH DE number 4066656 (Why is no real title available?)
• scientific article; zbMATH DE number 2033159 (Why is no real title available?)
• On the Partitioning Capabilities of Feedforward Neural Networks with Sigmoid Nodes
• The partitioning problem in unsupervised learning for nonlinear neurons
• Mean-field theory of graph neural networks in graph partitioning
• Learn to solve dominating set problem with GNN and reinforcement learning

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