Graph minimum linear arrangement by multilevel weighted edge contractions

Journal of Algorithms

Volumn 60, Issue 1, 2006, Pages 24-41

  Safro, Ilya ^a   Ron, Dorit ^a   Brandt, Achi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Coarsening; Combinatorial optimization; Graphs; Interpolation; Minimum linear arrangement; Multilevel computations; Relaxation; Simulated annealing; Weighted aggregation; Weighted edge contractions

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; INTERPOLATION; LINEAR ALGEBRA; LINEAR EQUATIONS; RELAXATION PROCESSES; SHRINKAGE; SIMULATED ANNEALING;

COARSENING; COMBINATORIAL OPTIMIZATIONS; GRAPHS; MINIMUM LINEAR ARRANGEMENTS; MULTILEVEL COMPUTATIONS; RELAXATION; WEIGHTED EDGE CONTRACTIONS;

GRAPH THEORY;

EID: 33646687961     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.10.004     Document Type: Article

References (31)

1. Bar-Yehuda R., Even G., Feldman J., and Naor J. Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems. J. Graph Algorithms Appl. 5 4 (2001) 1-27
2. A. Brandt, S. McCormick, J. Rudge, Algebraic multigrid (AMG) for automatic multigrid solution with application to geodetic computations, Institute for Computational Studies, POB 1852, Fort Collins, Colorado, 1982
3. Brandt A., McCormick S., and Rudge J. Algebraic multigrid (AMG) for sparse matrix equations. In: Evans D.J. (Ed). Sparsity and Its Applications (1984), Cambridge University Press, Cambridge 257-284
4. Brandt A. Algebraic multigrid theory: the symmetric case. Appl. Math. Comput. 19 (1986) 23-56
5. Brandt A., Ron D., and Amit D. Multi-level approaches to discrete-state and stochastic problems. In: Hackbush W., and Trottenberg U. (Eds). Multigrid Methods, II (1986), Springer-Verlag 66-99
6. Brandt A. Multiscale scientific computation: review 2001. In: Barth T., Haimes R., and Chan T. (Eds). Multiscale and Multiresolution Methods, Proceedings of the Yosemite Educational Symposium, October 2000 (2001), Springer-Verlag
7. Brandt A. General highly accurate algebraic coarsening. Gauss Center Report WI/GC-13, May 1999. Electron. Trans. Numer. Anal. 10 (2000) 1-20
8. Brandt A., and Ron D. Multigrid solvers and multilevel optimization strategies. In: Cong J., and Shinnerl J.R. (Eds). Multilevel Optimization and VLSICAD (2002), Kluwer
9. Briggs W.L., Henson V.E., and McCormick S.F. A Multigrid Tutorial. second ed. (2000), SIAM
10. Cheng C.K. Linear placement algorithms and applications to VLSI design. Networks 17 (1987) 439-464
11. Díaz J., Petit J., and Serna M. A survey on graph layout problems. ACM Comput. Surveys 34 3 (2002) 313-356
12. Díaz J., Petit J., Serna M., and Trevisan L. Approximating layout problems on random graphs. Discrete Math. 235 1-3 (2001) 245-253
13. Díaz J., Penrose M.D., Petit J., and Serna M.J. Approximating layout problems on random geometric graphs. J. Algorithms 39 1 (2001) 78-116
14. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 (1976) 237-267
15. Harper L.H. Optimal assignments of numbers to vertices. J. SIAM 12 1 (1964) 131-135
16. S. Horton, The optimal linear arrangement problem: algorithms and approximation, PhD Thesis, Georgia Institute of Technology, 1997
17. Juvan M., and Mohar B. Optimal linear labelings and eigenvalues of graphs. Discrete Appl. Math. 36 (1992) 153-168
18. Kirkpatrick S. Models of Disordered Systems. In: Castellani C., et al. (Ed). Lecture Notes in Phys. vol. 149 (1981), Springer-Verlag, Berlin
19. Koren Y., and Harel D. A multi-scale algorithm for the linear arrangement problem. Proceedings of 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'02). Lecture Notes in Comput. Sci. vol. 2573 (2002), Springer-Verlag 293-306
20. Lai Y., and Williams K. A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. J. Graph Theory 31 (1999) 75-94
21. Mehlhorn K., and Naher S. LEDA-a Platform for Combinatorial and Geometric Computing (1999), Cambridge University Press
22. Petit J. Experiments on the minimum linear arrangement problem. ACM J. Experimental Algorithmics 8 (2003)
23. Petit J. Combining spectral sequencing and parallel simulated annealing for the MinLA problem. Parallel Process. Lett. 13 1 (2003) 77-91
24. Poranen T. A genetic hillclimbing algorithm for the optimal linear arrangement problem (2002). http://www.cs.uta.fi/tp/optgen/
25. D. Ron, Development of fast numerical solvers for problems in optimization and statistical mechanics, PhD Thesis, The Weizmann Institute of Science, 1989
26. Ruge J., and Stüben K. Algebraic multigrid. In: McCormick S.F. (Ed). Multigrid Methods (1987), SIAM, Philadelphia 73-130
27. Safro I. The minimum linear arrangement problem. MSc Thesis, The Weizmann Institute of Science (2002). http://www.wisdom.weizmann.ac.il/~safro/thesis.ps
28. Shahrokhi F., Sykora O., Szekly L.A., and Vrto I. On bipartite drawings and the linear arrangement problem. Workshop on Algorithms and Data Structures (1997)
29. Sharon E., Brandt A., and Basri R. Fast multiscale image segmentation. Proceedings IEEE Conference on Computer Vision and Pattern Recognition, I (2000) 70-77
30. Stüben K. An introduction to algebraic multigrid. In: Trottenberg U., Oosterlee C.W., and Schüller A. (Eds). Multigrid (2001), Academic Press 413-532 Appendix
31. Stüben K. A review of algebraic multigrid. J. Comput. Appl. Math. 128 (2001) 281-309