BibTeX
@ARTICLE{
Hossain2008Gci,
abstract = "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 of the derivative matrices. The
effectiveness of our approach is demonstrated via a practical problem from computational molecular
biology. We also remark on the hardness of the generated coloring instances.",
author = "Hossain, Shahadat and Steihaug, Trond",
title = "Graph coloring in the estimation of sparse derivative matrices: Instances and
applications",
journal = "Discrete Appl. Math.",
volume = "156",
number = "2",
year = "2008",
issn = "0166218X",
pages = "280288",
doi = "http://dx.doi.org/10.1016/j.dam.2006.07.018",
publisher = "Elsevier Science Publishers B. V.",
address = "Amsterdam, The Netherlands, The Netherlands",
ad_theotech = "graph coloring, Sparsity"
}
