Skip to main content
Springer Nature Link
Log in

Graph Partitioning via Recurrent Multivalued Neural Networks

  • Conference paper
Computational Intelligence and Bioinspired Systems (IWANN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3512))

Included in the following conference series:

  • 3177 Accesses

Abstract

In this work, the well-known Graph Partitioning (GP) problem for undirected weighted graphs has been studied from two points of view: maximizing (MaxCut) or minimizing (MinCut) the cost of the cut induced in the graph by the partition. An unified model, based on a neural technique for optimization problems, has been applied to these two concrete problems. A detailed description of the model is presented, and the technique to minimize an energy function, that measures the goodness of solutions, is fully described. Some techniques to escape from local optima are presented as well. It has proved to be a very competitive and efficient algorithm, in terms of quality of solutions and computational time, when compared to the state-of-the-art methods. Some simulation results are presented in this paper, to show the comparative efficiency of the methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alberti, A., Bertoni, A., Campadelli, P., Grossi, G., Posenato, R.: A neural algorithm for MAX-2SAT: performance analysis and circuit implementation. Neural Networks 10-3, 555–560 (1997)

    Article  Google Scholar 

  2. Barahona, F., Grotschel, M., Junger, M., Reinelt, G.: An Application of combinatorial optimization to statistical physics and circuit layout design. Operat. Research 36, 493–513 (1988)

    Article  MATH  Google Scholar 

  3. Bertoni, A., Campadelli, P., Grossi, G.: An approximation algorithm for the maximum cut problem and its experimental analysis. Proceedings: Algorithms and experiments. Trento 9-11, 137–143 (1998)

    Google Scholar 

  4. Chatterjee, S., Gilbert, J.R., Schreiber, R., Sheffler, T.J.: Array Distribution in Data-Parallel Programs. In: Taylor, R.N., Coutaz, J. (eds.) ICSE-WS 1994 and SE-HCI 1994. LNCS, vol. 896, pp. 76–91. Springer, Heidelberg (1996)

    Google Scholar 

  5. Elias, P., Feinstein, A., Shannon, C.E.: Note on Maximum Flow Through a Network. IRE Transactions on Information Theory IT-2, 117–199 (1956)

    Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability. A guide to the theory of NP-Completeness. W. H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  7. Gomory, R., Hu, T.C.: Multi-terminal network flows. J. SIAM 9, 551–570 (1961)

    MATH  MathSciNet  Google Scholar 

  8. Johnson, E.J.L., Mehrotra, A., Nemhauser, G.L.: Min-cut clustering. Mathematical Programming 62(1), 133–151 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Karger, D.R.: Minimum cuts in near-linear time. In: Proc. 28th Annual ACM Symposium on Theory of Computing, pp. 56–63 (1996)

    Google Scholar 

  10. Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. Assoc. Comput. Mach. 43(4), 601–640 (1996)

    MATH  MathSciNet  Google Scholar 

  11. Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing 48(1), 96–129 (1998)

    Article  MathSciNet  Google Scholar 

  12. López-Rodríguez, D., Mérida-Casermeiro, E.: Matrix Bandwidth Minimization: A Neural Approach. In: Proceedings of International Conference of Computational Methods in Science and Engineering, ICCMSE, vol. 1, pp. 324–327 (2004)

    Google Scholar 

  13. Mérida-Casermeiro, E., Galán-Marín, G., Muñoz-Pérez, J.: An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem. Neural Processing Letters 14, 203–216 (2001)

    Article  MATH  Google Scholar 

  14. Mérida-Casermeiro, E., Muñoz-Pérez, J., Benítez-Rochel, R.: Neural Implementation of Dijkstra’s Algorithm. In: Mira, J., Álvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2686, pp. 342–349. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Mérida-Casermeiro, E., López-Rodríguez, D.: Multivalued Neural Network for Graph MaxCut Problem. In: Proceedings of International Conference of Computational Methods in Science and Engineering, ICCMSE, vol. 1, pp. 375–378 (2004)

    Google Scholar 

  16. Nagamochi, H., Ibaraki, T.: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. SIAM J. Disc. Meth. 5, 54–66 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Ramanathan, A., Colbourn, C.: Counting Almost Minimum Cutsets with Reliability Applications. Math. Prog. 39, 253–261 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  18. Takefuyi, Y., Wang, J.: Neural computing for optimization and combinatorics, vol. 3. World Scientific, Singapore (1996)

    Google Scholar 

  19. Wang, J., Tang, Z.: An improved optimal competitive Hopfield network for bipartite subgraph problems. Neurocomputing (in press)

    Google Scholar 

  20. Yang, D., Chung, Y., Chen, C., Liao, C.: A Dynamic Diffusion Optimization Method for Irregular Finite Element Graph Partitioning. The Journal of Supercomputing 17, 91–110 (2000)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, University of Málaga, Málaga, Spain

    Enrique Mérida-Casermeiro & Domingo López-Rodríguez

Authors
  1. Enrique Mérida-Casermeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Domingo López-Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Ingeniería Electrónica, Universitat Politècnica de Catalunya (UPC). E.T.S.I. de Telecomunicación, Campus Norte, Edificio C4, C/ Jordi Girona, 1-3, E08034, Barcelona, Spain

    Joan Cabestany

  2. Department of Computer Architecture and Computer Technology, University of Granada,  

    Alberto Prieto

  3. Grupo ISIS, Dpto. Tecnología Electrónica ETSI Telecomunicación, Universidad de Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Sandoval

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mérida-Casermeiro, E., López-Rodríguez, D. (2005). Graph Partitioning via Recurrent Multivalued Neural Networks. In: Cabestany, J., Prieto, A., Sandoval, F. (eds) Computational Intelligence and Bioinspired Systems. IWANN 2005. Lecture Notes in Computer Science, vol 3512. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494669_141

Download citation

  • DOI: https://doi.org/10.1007/11494669_141

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26208-4

  • Online ISBN: 978-3-540-32106-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation