# Graph coloring in sparse derivative matrix computation

@inproceedings{Goyal2005GraphCI, title={Graph coloring in sparse derivative matrix computation}, author={Mini Goyal}, year={2005} }

There has been extensive research activities in the last couple of years to efficiently determine large sparse Jacobian matrices. It is now well known that the estimation of Jacobian matrices can be posed as a graph coloring problem. Unidirectional coloring by Coleman and More [9] and bidirectional coloring independently proposed by Hossain and Steihaug [23] and Coleman and Verma [12] are techniques that employ graph theoretic ideas. In this thesis we present heuristic and exact bidirectional… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

SHOWING 1-3 OF 3 CITATIONS

## Bi-directional determination of sparse Jacobian matrices : algorithms and lower bounds

VIEW 6 EXCERPTS

CITES RESULTS, BACKGROUND & METHODS

HIGHLY INFLUENCED

## DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices

VIEW 2 EXCERPTS

CITES METHODS

## A multi-phase approach to university course timetabling

VIEW 2 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 31 REFERENCES