A BINARY NEURAL NETWORK ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM

[1]  Byung Ro Moon,et al.  Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.

[2]  Nobuo Funabiki,et al.  A binary neural network approach for max cut problems , 1996 .

[3]  Chingwei Yeh,et al.  A general purpose multiple way partitioning algorithm , 1991, 28th ACM/IEEE Design Automation Conference.

[4]  David E. van den Bout,et al.  Graph partitioning using annealed neural networks , 1990, International 1989 Joint Conference on Neural Networks.

[5]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[6]  Y. Akiyama,et al.  Combinatorial optimization with Gaussian machines , 1989, International 1989 Joint Conference on Neural Networks.

[7]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[8]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..