Skip to main content
SpringerLink
Log in

Using parallel genetic algorithms for solving the Min-Cut problem

  • Posters
  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1067))

Included in the following conference series:

  • 116 Accesses

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

References

  1. C.M. Fiduccia, R.M. Mettheyses, “A linear time heuristic for improving network partitions,” Proc. 19th ACM/IEEE Design Automation Conf., 1982, pp. 175–181

    Google Scholar 

  2. D.S. Johnson et al., “Optimization by simulated: An experimental evaluation; Part I, graph partitioning,” Operations Research, pp. 865–892, 1989

    Google Scholar 

  3. B.W. Kernighan, S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell System Technology Journal, vol. 49, no. 2, pp. 291–307, Feb. 1970

    Google Scholar 

  4. S. Kirpatrick et. al., “Optimization by simulated annealing”, Science, vol.220, pp. 671–680, May 1983

    Google Scholar 

  5. H. Muhlenbein, M. Schomisch, J. Born, “The Parallel Genetic Algorithm as Function Optimizer,” Parallel Computing, Vol. 17, 1991, pp. 619–632

    Google Scholar 

  6. C.W. Yeh, C.K. Cheng, T.T.Y.Lin “A general purpose multiple way partitioning algorithm”, Proc. 28th ACM/IEEE Design Automation Conf., 1991, pp. 421–426

    Google Scholar 

  7. C.W. Yeh, C.K. Cheng, T.T.Y. Lin “Optimization by Iterative Improvement: An Experimental Evaluation on Two-Way Partitioning”, IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 14, No. 2, Feb. 1995, pp. 145–153

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universitatea Politehnica Bucuresti, Bucuresti, Romania

    G. Godza

  2. Politecnico di Torino, Torino, Italy

    M. Rebaudengo & M. Sonza Reorda

Authors
  1. G. Godza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Rebaudengo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Sonza Reorda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Sonza Reorda .

Editor information

Heather Liddell Adrian Colbrook Bob Hertzberger Peter Sloot

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Godza, G., Rebaudengo, M., Reorda, M.S. (1996). Using parallel genetic algorithms for solving the Min-Cut problem. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_674

Download citation

  • DOI: https://doi.org/10.1007/3-540-61142-8_674

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49955-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation