Autocorrelation coefficient for the graph bipartitioning problem

Theoretical Computer Science

Volumn 191, Issue 1-2, 1998, Pages 229-243

  Angel, E ^a   Zissimopoulos, V ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Autocorrelation length; Graph bipartitioning problem; Local search; Simulated annealing

Indexed keywords

EID: 0000148241     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00176-X     Document Type: Article

References (8)

1. W. Feller, An Introduction to Probability Theory and its Applications, Wiley, New York, 1972.
2. M.R. Garey, D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
3. D.S. Johnson, C.R. Aragon, L.A. McGeoch, C. Schevon, Optimization by simulated annealing: an experimental evaluation; Part I, graph partitioning, Oper. Res. 37(6) (1989) 865-892.
4. D.S. Johnson, C.R. Aragon, L.A. McGeoch, C. Schevon, Optimization by simulated annealing: an experimental evaluation; Part II, graph coloring and number partitioning, Oper. Res. 39 (1991) 378-406.
5. B.W. Kernighan, S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Systems Tech. J. 49 (1970) 291-307.
6. P.F. Stadler, R. Happel, Correlation structure of the landscape of the graph-bipartitioning problem, J. Phys. A 25 (1992) 3103-3110.
7. P.F. Stadler, W. Schnabl, The landscape of the traveling salesman problem, Phys. Lett. A 161 (1992) 337-344.
8. E.D. Weinberger, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biol. Cybernet. 63 (1990) 325-336.