Skip to main content
SpringerLink
Log in

A Multiagent Algorithm for Graph Partitioning

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2006)

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

Included in the following conference series:

Abstract

The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrical and evolutionary methods. In this paper we present a new simple multiagent algorithm, ants, and we test its performance with standard graph benchmarks. The results show that this method can outperform several current methods while it is very simple to implement.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baños, R., Gil, C., Ortega, J., Montoya, F.G.: Multilevel heuristic algorithm for graph partitioning. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 143–153. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Abril, J., Comellas, F., Cortés, A., Ozón, J., Vaquer, M.: A multi-agent system for frequency assignment in cellular radio networks. IEEE Trans. Vehic. Tech. 49(5), 1558–1565 (2000)

    Article  Google Scholar 

  3. Comellas, F., Ozón, J.: Graph coloring algorithms for assignment problems in radio networks. In: Alspector, J., Goodman, R., Brown, T.X. (eds.) Proc. Applications of Neural Networks to Telecommunications 2, pp. 49–56. Lawrence Erlbaum Ass. Inc. Publis, Hillsdale (1995)

    Google Scholar 

  4. The Second DIMACS Implementation Challenge: 1992-1993: NP Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability. Organized by M. Trick, http://dimacs.rutgers.edu/Challenges/index.html , (accessed January 8, 2006)

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979) ISBN 0-7167-10447

    MATH  Google Scholar 

  6. Goldschmidt, O., Hochbaum, D.S.: Polynomial algorithm for the k-cut problem. In: Proc. 29th Ann. IEEE Symp. on Foundations of Comput. Sci., pp. 444–451. IEEE Computer Society Press, Los Alamitos (1988)

    Google Scholar 

  7. Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Karin, S. (ed.) Proc. Supercomputing 1995. ACM Press, New York (1995)

    Google Scholar 

  8. Korošec, P., Šilc, J., Robič, B.: Solving the mesh-partitioning problem with an antcolony algorithm. Parallel Computing 30(5-6), 785–801 (2004)

    Article  Google Scholar 

  9. Saran, H., Vazirani, V.: Finding k-cuts within twice the optimal. In: Proc. 32nd Ann. IEEE Symp. on Foundations of Comput. Sci., pp. 743–751. IEEE Computer Society, Los Alamitos (1991)

    Chapter  Google Scholar 

  10. Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph partitioning. J. Global Optimization 29(2), 225–241 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Trick, M.: Graph coloring instances (web page), http://mat.gsia.cmu.edu/COLOR/instances.html , (accessed January 8, 2006)

  12. Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Annals Oper. Res. 131, 325–372 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. Walshaw, C.: The graph partioning archive (web page), http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/ , (accessed January 8, 2006)

  14. Walshaw, C., Cross, M.: Mesh Partitioning: a Multilevel Balancing and Refinement Algorithm. SIAM J. Sci. Comput. 22(1), 63–80 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament de Matemàtica Aplicada IV, Universitat Politècnica de Catalunya, Avda. Canal Olímpic s/n, 08860, Castelldefels, Catalonia, Spain

    Francesc Comellas & Emili Sapena

Authors
  1. Francesc Comellas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emili Sapena
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Johannes Gutenberg University, Mainz, Germany

    Franz Rothlauf

  2. Institute AIFB, University of Karlsruhe, 76128, Karlsruhe, Germany

    Jürgen Branke

  3. Dipartimento di Ingegneria dell’Informazione, Università di Parma,  

    Stefano Cagnoni

  4. Centre of Informatics and Systems of the University of Coimbra,  

    Ernesto Costa

  5. Dept. LCC, Universidad de Málaga, Spain

    Carlos Cotta

  6. Institute of Computer Science, University of Bremen, 28359, Bremen, Germany

    Rolf Drechsler

  7. INRIA Saclay - Ile-de-France, Parc Orsay Université, 4, rue Jacques Monod, 91893, ORSAY Cedex, France

    Evelyne Lutton

  8. CISUC, Department of Informatics Engineering, University of Coimbra, Polo II of the University of Coimbra, 3030, Coimbra, Portugal

    Penousal Machado

  9. Dartmouth College, Lebanon, NH, USA

    Jason H. Moore

  10. Universidade de A Coruña, CP 15071, A Coruña, Spain

    Juan Romero

  11. School of Computing Sciences, UEA Norwich, University of East Anglia, NR4 7TJ, Norwich, UK

    George D. Smith

  12. Dipartimento di Automatica e Informatica, Politecnico di Torino, Italy

    Giovanni Squillero

  13. Kyushu University, Japan

    Hideyuki Takagi

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Comellas, F., Sapena, E. (2006). A Multiagent Algorithm for Graph Partitioning. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2006. Lecture Notes in Computer Science, vol 3907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11732242_25

Download citation

  • DOI: https://doi.org/10.1007/11732242_25

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-33238-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation