A near-optimum parallel algorithm for bipartite subgraph problem using the Hopfield neural network learning

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E85-A, Issue 2, 2002, Pages 497-504

  Wang, Rong Long ^a   Tang, Zheng ^a   Cao, Qi Ping ^b  

^a UNIVERSITY OF TOYAMA   (Japan)

^b Tateyama Systems Institute   (Japan)

Author keywords

Bipartite subgraph problem; Gradient ascent learning; Hopfield neural network; Maximum cut problem; NP complete problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; LEARNING ALGORITHMS; NEURAL NETWORKS; PARALLEL ALGORITHMS;

BIPARTITE SUBGRAPH PROBLEM; GRADIENT ASCENT LEARNING; HOPFIELD NEURAL NETWORKS;

GRAPH THEORY;

EID: 0036475107     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. Some simplified NP-complete graph problem
2. Reducibility among combinatorial problems
3. Largest bipartite subgraph in triangle-free graphs with maximum degree three
4. Weakly bipartite graphs and the max-cut problem
5. On some weakly bipartite graph
6. Neural networks and physical systems with emergent collective computational abilities
7. Neurons with graded response have collective computation properties like those of two-state neurons
8. 'Neural' computation of decisions in optimization problems
9. Simple 'Neural' optimization networks: An a/d converter, signal decision circuit, and a linear programming circuit
10. Computing with neural circuits: A model
11. A parallel improvement algorithm for the bipartite subgraph problem
12. A learning algorithm for Boltzman machines
13. Optimization by simulated annealing: An experimental evaluation; Part 1, graph partitioning
14. Efficient algorithm for the layer assignment problem
15. An application of combinatorial optimization to statistical physics and circuit layout design
16. Finding a maximum cut of a planar graph in polynomial time
17. Minimum-via topological routing