Artificial neural networks for the bipartite and k-partite subgraph problems

  • Jenn -Shiang Lai
  • Young -Ja Ko
  • Sy -Yen Kuo
Paper Sessions Neural Network
Part of the Lecture Notes in Computer Science book series (LNCS, volume 694)


In [1], Lee, Funabiki and Takefuji proposed a parallel algorithm for solving the bipartite subgraph problem with the maximum neural networks. In this paper, we present a new algorithm based on the discrete Hopfield network to deal with the same problem. Compared with the previous maximum neural network algorithm, our method can find solutions of same quality or better with half of neurons and much less computation time. Furthermore, for the general K-partite subgraph problem, a novel interactive Hopfield network system is devised to solve it effectively. The algorithm has been implemented and the experimental results indeed demonstrate the effectiveness of our approach.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. C. Lee, N. Funabiki, and Y. Takefuji, “A parallel improvement algorithm for the bipartite subgraph problem,” IEEE Trans. Neural Networks, Vol. 3, No. 1, January 1992, pp. 139–145.CrossRefGoogle Scholar
  2. 2.
    J. A. Bondy and S. C. Locke, “Largest bipartite subgraph in triangle free graphs with maximum degree three,” J. Graph Theory, Vol. 10, 1986, pp. 477–504.Google Scholar
  3. 3.
    F. Barahona, “On some weakly bipartite graphs,” Oper. Res. Lett., Vol. 2, No. 5, 1983, pp. 239–242.Google Scholar
  4. 4.
    C. P. Hsu, “Minimum-via topological routing,” IEEE Trans. Computer-Aided Design, Vol. 2, October 1983, pp. 235–246.Google Scholar
  5. 5.
    J. J. Hopfield, and D. W. Tank, “Neural computation of decisions in optimization problems,” Biolog. Cybern., Vol. 52, 1985, pp. 1–25.Google Scholar
  6. 6.
    J. J. Hopfield, “Neurons with graded response have collective computational properties like those of two state neurons,” Proc. Nat. Academy of Science, Vol. 81, No.10, May 1984, pp. 3088–3092.Google Scholar
  7. 7.
    D.E. Van den Bout and T. K. Miller, III, “Graph partitioning using annealed neural networks,” IEEE Trans. Neural Networks, Vol. 1, No. 2, June 1990, pp. 192–203.CrossRefGoogle Scholar
  8. 8.
    Y. Takefuji, and K. C. Lee “Artificial neural networks for four-coloring map problem and k-colorability,” IEEE Trans. Circuits Syst., Vol. 38, March 1991, pp. 326–333.Google Scholar
  9. 9.
    S. Chakradhar, M. Bushnell, and V. Agrawal, “Toward massively parallel test generation,” IEEE Trans. Computer-Aided Design, Vol. 9, September 1990, pp. 981–984.Google Scholar
  10. 10.
    G. A. Tagliarini, J. F. Christ, and E. W. Page, “Optimization using neural networks,” IEEE Trans. Computers, Vol. 40, No. 12, December 1991, pp. 1347–1358.Google Scholar
  11. 11.
    R. L. Lippmann, “An introduction to computing with neural nets,” IEEE ASSP Mag., Vol. 4, 1987, pp. 4–22.Google Scholar
  12. 12.
    Philip D. Wasserman, “Neural Computing, Theory and Practice,” Van Nostrand Reinhold, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Jenn -Shiang Lai
    • 1
  • Young -Ja Ko
    • 1
  • Sy -Yen Kuo
    • 1
  1. 1.Department of Electrical EngineeringNational Taiwan UniversityTaipeiTaiwan, R. O. C.

Personalised recommendations