This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Technique for Optimization Problems in Graph Theory
February 1998 (vol. 47 no. 2)
pp. 190-196

Abstract—This paper presents an efficient technique to map the minimum vertex cover and two closely related problems (maximum independent set and maximum clique) onto the Hopfield neural networks. The proposed approach can be used to find near-optimum solutions for these problems in parallel, and particularly the network algorithm always yields minimal vertex covers. A systematic way of deriving energy functions is described. Based on these relationships, other NP-complete problems in graph theory can also be solved by neural networks. Extensive simulations were performed, and the experimental results show that the network algorithm outperforms the well-known greedy algorithm for vertex cover problems.

[1] A. Jagota, "Optimization by Reduction to Maximum Clique," Proc. Int'l Conf. Neural Networks, pp. 1,526-1,531, 1993.
[2] A. Jagota, "Optimization by a Hopfield-Style Network," Optimality in Biological and Artificial Neural Networks, D.S. Levine and W.L. Elsberry, eds., 1994.
[3] J.H.M. Korst and E.H.L. Aarts, "Combinatorial Optimization on a Boltzmann Machine," J. Parallel and Distributed Computing, vol. 3, no. 6, pp. 2,528-2,531, 1992.
[4] Y. Shrivastava, S. Dasgupta, and S.M. Reddy, "Neural Network Solutions to a Graph Theoretic Problem," Proc. IEEE Int'l Symp. Circuits and System, vol. 3, no. 6, pp. 2,528-2,531, 1990.
[5] J. Ramanujam and P. Sadayappan, "Optimization by Neural Networks," Proc. Int'l Conf. Neural Networks, vol. 2, pp. 325-332, 1988.
[6] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[7] G. Tinhofer et al., Computational Graph Theory.Vienna: Springer-Verlag, 1990.
[8] M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs.New York, Academic Press, 1980.
[9] J. Naft, "Neuropt: Neurocomputing for Multiobjective Design Optimization for Printed Circuit Board Component," Proc. Int'l Joint Conf. Neural Networks., pp. 503-506, 1989.
[10] B. Vinnakota and J. Andrews, "Repair of RAMs with Clustered Faults," Proc. Int'l Conf. Computer-Aided-Design, pp. 582-585, 1992.
[11] D. Johnson, "Approximation Algorithms for Combinatorial Problems," J. Computer System Science, vol. 9, 1974.
[12] Y. Peng, J.A. Reggia, and T. Li, "A Connectionist Approach to Vertex Covering Problems," Int'l J. Neural Systems, vol. 3, no. 1, pp. 43-56, 1992.
[13] J.J. Hopfield, "Neural Networks and Physical System with Convergent Collective Computational Properties," Proc. Nat'l Academy Science U.S., vol. 79, pp. 2,554-2,558, 1982.
[14] A.B. Kahng, "Traveling Salesman Heuristics and Embedding Dimension in Hopfield Model," Proc. Int'l Joint Conf. Neural Networks., pp. 513-520, 1989.
[15] P.D. Wasserman, Neural Computing, Theory and Practice. Van Nostrand Reinhold, 1989.
[16] I. Matsuba, "Optimal Simulated Annealing Method and Its Application Combinatorial Problems," Proc. Int'l Joint Conf. Neural Networks., pp. 541-546, 1989.
[17] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[18] Y. Takefuji, L.L. Chen, and J. Huffman, "Parallel Algorithm for Finding a Near-Maximum Independent Set of a Circle Graph," IEEE Trans. Neural Networks, vol. 1, no. 3, pp. 263-267, 1990.
[19] Y. Takefuji and K.C. Lee, "Artificial Neural Networks for Four-Coloring Map Problems and k-Colorability Problems," IEEE Trans. Circuits and Systems, vol. 38, no. 3, pp. 326-333, 1991.
[20] J.S. Lai and S.Y. Kuo, "A Hopfield Network Algorithm for the Bipartite Subgraph Problem," Proc. Third Int'l Conf. Young Computer Scientists, July 1993.
[21] D.E. Van Den Bout and T.K. Miller, III,“Graph partitioning using annealed neural network,” IEEE Trans. on Neural Networks, vol. 1, no. 2, June 1990.
[22] J.J. Hopfield and D.W. Tank, "Neural Computation of Decisions in Optimization Problems," Biological Cybernetics, vol. 52, pp. 1-25, 1985.
[23] G.A. Tagliarini, J.F. Christ, and E.W. Page, "Optimization Using Neural Networks," IEEE Trans. Computers, vol. 40, no. 12, pp. 1,347-1,358, Dec. 1991.
[24] J.J. Hopfield and D.W. Tank, "Computing with Neural Circuits: A Model," Science, vol. 233, pp. 625-633, Aug. 1986.
[25] C.W. Yu and G.H. Chen, "The Weighted Maximum Independent Set Problem in Permutation Graph," BIT, vol. 32, pp. 609-618, 1992.
[26] R.C. Chang and H.S. Lee, "Finding a Maximum Set of Independent Chords in a Circle," Information Processing Letters, vol. 41, pp. 99-102, 1992.
[27] H. Kim, "Finding a Maximum Set in a Permutation Graph," Information Processing Letters, vol. 36, pp. 19-23, 1990.
[28] L. Chen, "Optimal Parallel Time Bounds for Maximum Clique Problem on Intervals," Information Processing Letters, vol. 42, pp. 197-201, 1992.
[29] W.K. Shih and W.L. Hsu, "An O(n log n + m log log n) Maximum Weight Clique Algorithm for Circular-Arc Graphs," Information Processing Letters, vol. 31, pp. 129-134, 1989.
[30] M.S. Chan and F.H. Wang, "Efficient Algorithm for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs," Information Processing Letters, vol. 43, pp. 293-295, 1992.
[31] J.E. Burns, "The Maximum Independent Set Problem for Cubic Planar Graphs," Network, vol. 19, pp. 373-378, 1989.
[32] Zeugmann, "Parallel Algorithms," Encyclopedia of Computer Science and Technology, vol. 21, pp. 223-244.New York: Marcel-Dekker.

Index Terms:
Vertex cover, maximum independent set, maximum clique, neural network, Hopfield model.
Citation:
Shih-Yi Yuan, Sy-Yen Kuo, "A New Technique for Optimization Problems in Graph Theory," IEEE Transactions on Computers, vol. 47, no. 2, pp. 190-196, Feb. 1998, doi:10.1109/12.663765
Usage of this product signifies your acceptance of the Terms of Use.