Scalable parallel graph coloring algorithms

Concurrency Practice and Experience

Volumn 12, Issue 12, 2000, Pages 1131-1146

  Gebremedhin, Assefaw Hadish ^a   Manne, Fredrik ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; FINITE ELEMENT METHOD; GRAPH THEORY; HEURISTIC PROGRAMMING; PARALLEL ALGORITHMS; RESPONSE TIME (COMPUTER SYSTEMS); SUPERCOMPUTERS;

GRAPH COLORING; OPENMP CODES; RUN TIME ANALYSIS; SHARED MEMORY PROGRAMMING;

PARALLEL PROCESSING SYSTEMS;

EID: 0034291355     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/1096-9128(200010)12:12<1131::AID-CPE528>3.0.CO;2-2     Document Type: Article

References (17)

1. Lewandowski G. Practical implementations and applications of graph coloring. PhD Thesis, University of Wisconsin-Madison, August 1994.
2. Gamst A. Some lower bounds for a class of frequency assignment problems. IEEE Transactions of Vehicular Technology 1986; 35(1):8-14.
3. Chaitin GJ, Auslander M, Chandra AK, Cocke J, Hopkins ME, Markstein P. Register allocation via coloring. Computer Languages 1981; 6:47-57.
4. Garey MR, Johnson DS, So HC. An application of graph coloring to printed circuit testing. IEEE Transactions on Circuits and Systems 1976; 23:591-599.
5. Allwright JR, Bordawekar R, Coddington PD, Dincer K, Martin CL. A comparison of parallel graph coloring algorithms. Technical Report SCCS-666, Northeast Parallel Architecture Center, Syracuse University, 1995.
6. Coleman TF, More JJ. Estimation of sparse jacobian matrices and graph coloring problems. SIAM Journal on Numerical Analysis 1983; 20(1); 187-209.
7. Garey MR, Johnson DS. Computers and Intractability. W. H. Freeman: New York, 1979.
8. Manne F. A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices (extended abstract). (Lecture Notes in Computer Science, vol. 1541). Springer, 1998; 332-336.
9. Jones MT, Plassmann PE. A parallel graph coloring heuristic. SIAM Journal of Scientific Computing 1993; 14(3):654-669.
10. OpenMP. A proposed industry standard api for shared memory programming, http://www.openmp.org/.
11. Welsh DJA, Powell MB. An upper bound for the chromatic number of a graph and its application to timetabling problems. Computer Journal 1967; 10:85-86.
12. Brelaz D. New methods to color the vertices of a graph. Communications of the ACM 1979; 22(4):251-256.
13. Grimmet GR, McDiarmid CJH. On coloring random graphs. Mathematical Proceedings of the Cambridge Philosophical Society 1975; 77:313-324.
14. Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing 1986; 15(4): 1036-1053.
15. Gjertsen Jr. RK, Jones MT, Plassman P. Parallel heuristics for improved, balanced graph colorings. Journal of Parallel and Distributed Computing 1996; 37:171-186.
16. Culberson JC. Iterated greedy graph coloring and the difficulty landscape. Technical Report TR 92-07, Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada, June 1992.
17. Gebremedhin AH, Lassous IG, Gustedt J, Telle JA. Graph coloring on a coarse grained multiprocessor. Presented at WG 2000, 26th International Workshop on Graph-Theoretic Concepts in Computer Science, 15-17 June 2000, Konstantz, Germany.