Parallel distance-k coloring algorithms for numerical optimization

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

Volumn 2400, Issue , 2002, Pages 912-921

  Gebremedhin, Assefaw Hadish ^a   Manne, Fredrik ^a   Pothen, Alex ^b,c,d  

^a UNIVERSITY OF BERGEN   (Norway)

^b ECS Building   (United States)

^c SANDIA NATIONAL LABORATORIES   (United States)

^d NASA LANGLEY RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMMING INTERFACES (API); COLORING; MATRIX ALGEBRA; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

DISTRIBUTED MEMORY; EFFICIENT ESTIMATION; GRAPH COLORING PROBLEM; LARGE-SCALE OPTIMIZATION; MATRIX ESTIMATION; MATRIX PARTITIONING PROBLEMS; NUMERICAL OPTIMIZATIONS; SHARED ADDRESS SPACES;

GRAPH THEORY;

EID: 62149097011     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45706-2_130     Document Type: Conference Paper

References (12)

1. T. F. Coleman and J. J. Moré. Estimation of sparse Jacobian matrices andgraph coloring problems. SIAM J. Numer. Anal., 20(1):187–209, February 1983.
2. T. F. Coleman and J. J. Moré. Estimation of sparse Hessian matrices andgraph coloring problems. Math. Program., 28:243–270, 1984.
3. T. F. Coleman and A. Verma. The efficient computation of sparse Jacobian matrices using automatic differentiation. SIAM J. Sci. Comput., 19(4):1210–1233, July 1998.
4. I. Finocchi, A. Panconesi, and R. Silvestri. Experimental analysis of simple, distributedv ertex coloring algorithms. In Proceedings of the Thirteenth ACM-SIAM Symposium on Discrete Algorithms (SODA 02), San Francisco, CA, 2002.
5. A. H. Gebremedhin and F. Manne. Scalable parallel graph coloring algorithms. Concurrency: Pract. Exper., 12:1131–1146, 2000.
6. A. H. Gebremedhin, F. Manne, and A. Pothen. Graph coloring in optimization revisited. Technical Report 226, University of Bergen, Dept. of Informatics, Norway, January 2002. Available at: http://www.ii.uib.no/publikasjoner/texrap/.
7. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. OxfordUniv ersity Press, New York, 1995.
8. A.K.M. S. Hossain and T. Steihaug. Computing a sparse Jacobian matrix by rows andcolumns. Optimization Methods and Software, 10:33–48, 1998.
9. M. T. Jones and P. E. Plassmann. A parallel graph coloring heuristic. SIAM J. Sci. Comput., 14(3):654–669, May 1993.
10. S. O. Krumke, M. V. Marathe, and S. S. Ravi. Approximation algorithms for channel assignment in radio networks. In DIAL M for Mobility, Dallas, Texas, 1998.
11. S. T. McCormick. Optimal approximation of sparse Hessians andits equivalence to a graph coloring problem. Math. Program., 26:153–171, 1983.
12. V. V. Vazirani. Approximation Algorithms. Springer, 2001. Chapter 5.