We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned sparse derivative matrices. The size of the graph is dependent on the partition and can be varied between the number of columns and the number of nonzero entries. If solved exactly our proposal will yield a significant reduction in computational cost. Coloring results from backtrack DSATUR and Small-k algorithms applied on the coloring instances are given. We analyze the test results and remark on the hardness of the generated coloring instances.
Article
View Graph Coloring in the Estimation of Sparse Derivative Matrices: Instances and Applications