References
- G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation: Combinatorial Optimization Problem s and their Approximability Properties, Springer-Verlag, Berlin, 1999.
- B. Bollobás, Modern Graph Theory, Vol. 184 of Graduate Texts in Mathematics, Springer, New York, 1998.
- T.F. Coleman and A. Verma, The efficient computation of sparse Jacobian matrices using automatic differentiation, SIAM. J. Sci. Comput. 18(4) (1998), pp. 1201–1233.
- T.A. Davis, and Y. Hu, The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38 (1) (2011), pp. 1:1–1:25.
- G. Fertin, A. Raspaud, and B. Reed, Star coloring of graphs, J. Graph Theory 47(3) (2004), pp. 163–182. doi:10.1002/jgt.20029.
- A. Gebremedhin, F. Manne, and A. Pothen, What color is your Jacobian? Graph coloring for computing derivatives, SIAM Rev. 47(4) (2005), pp. 629–705. doi: 10.1137/S0036144504444711
- A. Griewank, D. Juedes, and J. Utke, ADOL-C:a package for the automatic differentation of algorithms written in C/C++, ACM Trans. Math. Softw. 22 (1996), pp. 131–167. doi: 10.1145/229473.229474
- A.S. Hossain, On the computation of sparse Jacobian matrices and Newton steps, Ph.D. thesis, Department of Informatics, University of Bergen, Tech. Rep. 146, 1998.
- S. Hossain and T. Steihaug, Computing a sparse Jacobian matrix by rows and columns, Optim. Methods Softw. 10 (1998), pp. 33–48. doi: 10.1080/10556789808805700
- D. Juedes and J. Jones, Coloring Jacobians revisited: A new algorithm for star and acyclic bicoloring, Optim. Methods Softw. 27(1–3) (2012), pp. 295–309. doi: 10.1080/10556788.2011.606575
- U. Naumann and O. Schenk, Combinatorial Scientific Computing, Chapman and Hall/CRC Press, Boca Raton, FL, 2012.