Graph coloring in the estimation of mathematical derivatives

Shahadat Hossain and Trond Steihaug

To appear at Computational Symposium on Graph Coloring and Generalizations (COLOR02), Ithaca, NY, 7-8 September 2002

Abstract

We describe graph coloring instances arising in numerical estimation of mathematical derivatives. The coloring instances are obtained from a matrix partitioning problem. The size of the generated graphs is dependent on the number of segmented columns which can be varied between the number of columns and the number of nonzeros in the associated matrix.

Server START Conference Manager
Update Time 23 Jul 2002 at 13:35:57
Maintainer trick@cmu.edu.
Start Conference Manager
Conference Systems