Speeding up parallel graph coloring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3732 LNCS, Issue , 2006, Pages 1079-1088

  Gebremedhin, Assefaw H ^a   Manne, Fredrik ^b   Woods, Tom ^b  

^a ECS Building   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; GRAPH THEORY; PROBLEM SOLVING; RESOURCE ALLOCATION; SUPERCOMPUTERS;

GRAPH COLORING PROBLEMS; GRAPH PARTITIONING; PARALLELIZATION; VERTEX-TO-PROCESSOR ASSIGNMENTS;

PARALLEL PROCESSING SYSTEMS;

EID: 33745305714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558958_130     Document Type: Conference Paper

References (16)

1. J. ALLWRIGHT, R. BORDAWEKAR, P. D. CODDINGTON, K. DINCER, AND C. MARTIN, A comparison of parallel graph coloring algorithms, NPAC technical report SCCS-666, Northeast Parallel Architectures Center at Syracuse University, 1994.
2. T. F. COLEMAN AND J. J. MORE, Estimation of sparse Jacobian matrices and graph coloring problems, SIAM J. Numer. Anal., 1 (1983), pp. 187-209.
3. P. CRESCENZI AND V. KANN, A compendium of NP optimization problems. http://www.nada.kth.se/~viggo/wwwcompendium/.
4. E. CUTHILL AND J. MCKEE, Reducing the bandwidth of sparse symmetric matrices, in proceedings of ACM NAT. Conf., 1969, pp. 157-172.
5. I. FINOCCHI, A. PANCONESI, AND R. SILVESTRI, Experimental analysis of simple, distributed vertex coloring algorithms, in Proc. 13th ACM-SIAM symposium on Discrete Algorithms (SODA 02), 2002.
6. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability, Freeman, 1979.
7. A. H. GEBREMEDHIN, F. MANNE, AND A. POTHEN, Parallel distance-k coloring algorithms for numerical optimization, in proceedings of Euro-Par 2002, vol. 2400, Lecture Notes in Computer Science, Springer, 2002, pp. 912-921.
8. A. H. GEBREMEDHIN AND F. MANNE, Scalable parallel graph coloring algorithms, Concurrency: Practice and Experience, 12 (2000), pp. 1131-1146.
9. R. K. GJERTSEN JR., M. T. JONES, AND P. PLASSMANN, Parallel heuristics for improved, balanced graph colorings, J. Par. Dist. Comput., 37 (1996), pp. 171-186.
10. A. GRAMA, A. GUPTA, G. KARYPIS, AND V. KUMAR, Introduction to Parallel Computing, 2ed, Addison Wesley, 2003.
11. Ö. JOHANSSON, Simple distributed δ + 1-coloring of graphs, Inf. Proc. Letters, 70 (1999), pp. 229-232.
12. M. T. JONES AND P. PLASSMAN, A parallel graph coloring heuristic, SIAM J. Sci. Comput., (1993), pp. 654-669.
13. G. KARYPIS. Private communications.
14. G. KARYPIS AND V. KUMAR, Multilevel k-way partitioning scheme for irregular graphs, J. Par. Dist. Comp., 48 (1998), pp. 96-129.
15. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., (1986), pp. 1036-1053.
16. S. M. ROSS, Introduction to Probability Models, 7ed, Academic Press, 2000.