Parallel heuristics for improved, balanced graph colorings

Journal of Parallel and Distributed Computing

Volumn 37, Issue 2, 1996, Pages 171-186

  Gjertsen Jr , Robert K ^a   Jones, Mark T ^b   Plassmann, Paul E ^c  

^a University of Illinois at Urbana Champaign   (United States)

^b University of Tennessee Knoxville   (United States)

^c ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030587369     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0117     Document Type: Article

References (25)

1. 1. Allwright, J., Bordawekar, R., Coddington, P., Dincer, K., and Martin, C. A comparison of parallel graph coloring algorithms. Tech. Rep. SCCS-666, Northeast Parallel Architectures Center, Syracuse University, 1995.
2. 2. Brélaz, D. New methods to color the vertices of a graph. Comm. ACM 22 (1979), 251-256.
3. 3. Canfield, T., Jones, M., Plassmann, P., and Tang, M. Thermal effects on the frequency response of piezoelectric crystals. In New Methods in Transient Analysis, PVP, Vol. 246 and AMD, Vol. 143. ASME, New York, 1992, pp. 103-108.
4. 4. Coleman, T. F. and Moré, J. J. Estimation of sparse Jacobian matrices and graph coloring problems, SIAM J. Numer. Anal. 20 (1983), 187-209.
5. 5. Duff, I. S., Grimes, R., Lewis, J., and Poole, B. Sparse matrix test problems, SIGNUM Newsletter 17 (1982), 22.
6. 6. Duff, I. S. and Meurant, G. A. The effect of ordering on preconditioned conjugate gradients, BIT 29 (1989), 635-657.
7. 7. Duff, I. S. and Reid, J. K. Performance evaluation of codes for sparse matrix problems. In Fosdick, L. (Ed.). Performance Evaluation of Numerical Software. North-Holland, Amsterdam, 1979, pp. 121-135.
8. 8. Garey, M. R. and Johnson, D. S. Computers and Intractability. Freeman, New York, 1979.
9. 9. Gjertsen, R. K. Jr., Parallel graph coloring heuristics, Master's thesis, University of Illinois at Urbana-Champaign, 1994.
10. 10. Hendrickson, B. and Leland, R. The Chaco user's guide: Version 2.0. Sandia Report SAND94-2692, Sandia National Laboratories, Albuquerque, NM, 1995.
11. 11. JáJá, J. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.
12. 12. Jones, M. T. and Plassmann, P. E. A parallel graph coloring heuristic, SIAM J. Sci. Comput. 14 (1993), 654-669.
13. 13. Jones, M. T. and Plassmann, P. E. Computational results for parallel unstructured mesh computations. Comput. Systems Eng. 5 (1994), 297-309.
14. 14. Jones, M. T. and Plassmann, P. E. Scalable iterative solution of sparse linear systems, Parallel Comput. 20 (1994), 753-773.
15. 15. Jones, M. T. and Plassmann, P. E. Parallel algorithms for adaptive mesh refinement, SIAM J. Sci. Comput. to appear.
16. 16. Lipton, R. J., Rose, D. J., and Tarjan, R. E. Generalized nested dissection, SIAM J. Numer. Anal. 16 (1979), 346-358.
17. 17. Luby, M. A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput. 4 (1986), 1036-1053.
18. 18. Matula, D., Marble, G., and Isaacson, J. Graph coloring algorithms. In Read, R. (Ed.). Graph Theory and Computing. Academic Press, San Diego, 1972, pp. 104-122.
19. 19. Melhem, R. G. and Ramarao, V. S. Multicolor reorderings of sparse matrices resulting from irregular grids, ACM Trans. Math. Software 14 (1988), 117-138.
20. 20. Ortega, J. M. Orderings for conjugate gradient preconditionings, SIAM J. Optimization 1 (1991), 565-582.
21. 21. Pommerell, C., Annaratone, M., and Fichtner, W. A set of new mapping and coloring heuristics for distributed-memory parallel processors, SIAM J. Sci. Statist. Comput. 13 (1992), 194-226.
22. 22. Pothen, A., Simon, H., and Liou, K.-P. Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. 11 (1990), 430-452.
23. 23. Schreiber, R. and Tang, W.-P. Vectorizing the conjugate gradient method. Unpublished manuscript, Department of Computer Science, Stanford University, 1982.
24. 24. Vavasis, S. Automatic domain partitioning in three dimensions, SIAM J. Sci. Statisti. Comput. 12 (1991), 950-970.
25. 25. Welsh, D. and Powell, M. An upper bound for the chromatic number of a graph and its application to timetabling parameters, Comput. J. 10 (1967), 85-86.