An approximation algorithm for graph partitioning via deterministic annealing neural network (Q2185605)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7208945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for graph partitioning via deterministic annealing neural network |
scientific article; zbMATH DE number 7208945 |
Statements
An approximation algorithm for graph partitioning via deterministic annealing neural network (English)
0 references
5 June 2020
0 references
graph partitioning
0 references
neural network
0 references
combinatorial optimization
0 references
NP-hard problem
0 references
deterministic annealing neural network algorithm
0 references
0 references
0 references
0.8543056845664978
0 references
0.8083783984184265
0 references
0.7958903908729553
0 references
