A parallel distance-2 graph coloring algorithm for distributed memory computers

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

Volumn 3726 LNCS, Issue , 2005, Pages 796-806

  Bozdaǧ, Doruk ^a   Catalyurek, Umit ^a   Gebremedhin, Assefaw H ^b   Manne, Fredrik ^c   Boman, Erik G ^d   Özgüner, Füsun ^a  

^a OHIO STATE UNIVERSITY   (United States)

^b OLD DOMINION UNIVERSITY   (United States)

^c UNIVERSITY OF BERGEN   (Norway)

^d SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER GRAPHICS; HEURISTIC METHODS; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING;

CHANNEL ASSIGNMENT; COLORING ALGORITHMS; HEURIS-TIC ALGORITHMS; NUMERICAL OPTIMIZATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646392441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. Gebremedhin, A.H., Manne, F., Pothen, A.: What color is your jacobian? Graph coloring for computing derivatives. SIAM Rev. (2005) To appear.
2. Krumke, S., Marathe, M., Ravi, S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks 7 (2001) 575 - 584
3. Vazirani, V.V.: Approximation Algorithms. Springer (2001)
4. Ferreira, A., Pérennes, S., Richa, A.W., Rivano, H., Stier, N.: Models, complexity and algorithms for the design of multi-fiber wdm networks. Telecommunication Systems 24 (2003) 123-138
5. McCormick, S.T.: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem. Math. Programming 26 (1983) 153 - 171
6. Boman, E.G., Bozdaǧ, D., Catalyurek, U., Gebremedhin, A.H., Manne, F.: A scalable parallel graph coloring algorithm for distributed memory computers. (EuroPar 2005, to appear)
7. Gebremedhin, A.H., Manne, F.: Scalable parallel graph coloring algorithms. Concurrency: Practice and Experience 12 (2000) 1131-1146
8. Gebremedhin, A.H., Manne, F., Woods, T.: Speeding up parallel graph coloring. In: proceedings of Para 2004, Lecture Notes in Computer Science, Springer (2004)
9. Jones, M.T., Plassmann, P.: A parallel graph coloring heuristic. SIAM J. Sci. Comput. 14 (1993) 654-669
10. Gebremedhin, A.H., Manne, F., Pothen, A.: Parallel distance-k coloring algorithms for numerical optimization. In: proceedings of Euro-Par 2002. Volume 2400., Lecture Notes in Computer Science, Springer (2002) 912-921
11. : (Test data from the parasol project) http://www.parallab.uib.no/ projects/parasol/data/.
12. : (University of florida matrix collection) http://www.cise.ufl.edu/ research/sparse/matrices/.
13. Strout, M.M., Hovland, P.D.: Metrics and models for reordering transformations. In: proceedings of MSP 2004. (2004) 23-34