New acyclic and star coloring algorithms with application to computing hessians

SIAM Journal on Scientific Computing

Volumn 29, Issue 3, 2007, Pages 1042-1072

  Gebremedhin, Assefaw H ^a   Tarafdar, Arijit ^a   Manne, Fredrik ^b   Pothen, Alex ^a  

^a ECS Building   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

Acyclic coloring; Automatic differentiation; Computation of Hessians; Finite differences; Star coloring

Indexed keywords

COMPUTATION THEORY; FINITE DIFFERENCE METHOD; HEURISTIC METHODS; PROBLEM SOLVING;

ACYCLIC COLORING; AUTOMATIC DIFFERENTIATION; STAR COLORING;

ALGORITHMS;

EID: 36048955533     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/050639879     Document Type: Article

References (30)

1. G. AGNARSSON, R. GREENLAW, AND M. M. HALLDÓRSSON, On powers of chordal graphs and their colorings, Congr. Numer., 100 (2000), pp. 41-65.
2. G. AGNARSSON AND M. M. HALLDÓRSSON, Coloring powers of planar graphs, SIAM J. Discrete Math., 16 (2003), pp. 651-662.
3. G. AGNARSSON AND M. M. HALLDÓRSSON, Coloring powers of planar graphs, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2000, pp. 654-662.
4. 4 's, Electron. J. Combin., 11 (2004), article R26.
5. S. ARORA AND C. LUND, Hardness of approximations, in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, ed., PWS Publishing, Boston, MA, 1997, Chap. 10, pp. 399-446.
6. H. BALAKRISHNAN, C. L. BARRETT, V. S. A. KUMAR, M. V. MARATHE, AND S. THITE, The distance-2 matching problem and its application to the MAC-layer capacity of ad hoc wireless networks, IEEE J. Selected Areas in Commun., 22 (2004), pp. 1069-1079.
7. O. V. BORODIN, On acyclic colorings of planar graphs, Discrete Math., 25 (1979), pp. 211 236.
8. B. BROOKS, R. BRUCCOLERI, B. OLAFSON, D. STATES. S. SWAMINATHAN. AND M. KARPLUS, CHARMM: A program for macromolecular energy, minimization, and dynamics calculations, J. Comput. Chem., 4 (1983), pp. 187-217.
9. T. F. COLEMAN AND J.-Y. CAI, The cyclic coloring problem and estimation of sparse Hessian matrices, SIAM J. Algebraic Discrete Methods, 7 (1986), pp. 221-235.
10. T. F. COLEMAN, B. GARBOW, AND J. J. MORÉ, Software for estimating sparse Jacobian matrices, ACM Trans. Math. Softw., 10 (1984), pp. 329-347.
11. T. F. COLEMAN, B. GARBOW, AND J. J. MORÉ, Software for estimating sparse Hessian matrices, ACM Trans. Math. Softw., 11 (1985), pp. 363-377.
12. T. F. COLEMAN AND J. J. MORÉ, Estimation of sparse Jacobian matrices and graph coloring roblems, SIAM J. Numer. Anal., 20 (1983), pp. 187-209.
13. T. F. COLEMAN AND J. J. MORÉ, Estimation of sparse Hessian matrices and graph coloring problems, Math. Program., 28 (1984), pp. 243-270.
14. T. F. COLEMAN AND A. VERMA, The efficient computation of sparse Jacobian matrices using automatic differentiation, SIAM J. Sci. Comput., 19 (1998), pp. 1210-1233.
15. T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST, AND C. STEIN, Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA, 2001.
16. A. R. CURTIS, M. J. D. POWELL, AND J. K. REID, On the estimation of sparse Jacobian matrices, J. Inst. Math. Appl., 13 (1974), pp. 117-119.
17. A. H. GEBREMEDHIN, F. MANNE, AND A. POTHEN, What color is your Jacobian? Graph coloring for computing derivatives, SIAM Rev., 47 (2005), pp. 629-705.
18. A. H. GEBREMEDHIN, A. POTHEN, A. TARAFDAR, AND A. WALTHER, Efficient computation of sparse Hessians: An experimental study using ADOL-C, submitted, 2006.
19. A. GRIEWANK, Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, SIAM, Philadelphia, 2000.
20. A. GRIEWANK. D. JUEDES. AND J. UTKE, ADOL-C: A package for the automatic differentiation of algorithms written in C/C++, ACM Trans. Math. Softw., 22 (1996), pp. 131-167.
21. B. GRÜNBAUM, Acyclic colorings of planar graphs, Israel J. Math., 14 (1973), pp. 390-408.
22. S. HOSSAIN AND T. STEIHAUG, Computing a sparse Jacobian matrix by rows and columns, Optim. Methods Softw., 10 (1998), pp. 33-48.
23. T. JENSEN AND B. TOFT, Graph Coloring Problems, Wiley-Interscience, New York, 1995.
24. S. O. KRUMKE, M. V. MARATHE. AND S. S. RAVI, Models and approximation algorithms for channel assignment in radio networks, Wireless Networks, 7 (2001), pp. 567 - 574.
25. V. S. A. KUMAR, M. V. MARATHE, S. P ARTHASARATHY, AND A. SRINIVASAN, End-to-end packet-scheduling in wireless ad-hoc networks, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2004, pp. 1014-1023.
26. Y.-L. LIN AND S. S. SAKIENA, Algorithms for square roots of graphs, SIAM J. Discrete Math., 8 (1995), pp. 99-118.
27. S. T. MCCORMICK, Optnnal approximation of sparse Hessians and its equivalence to a graph coloring problem, Math. Program., 26 (1983), pp. 153-171.
28. M. J. D. POWELL AND P. L. TOINT, On the estimation of sparse Hessian matrices, SIAM J. Numer. Anal., L6 (1979), pp. 1060-1074.
29. L. STOCKMEYER AND V. VAZIRANI, NP-completeness of some generalizations of the maximum matching problem, Inform. Process. Lett., 15 (1982), pp. 14-19.
30. M. M. STROUT AND P. D. HOVLAND, Metrics and models for reordering transformations, in Proceedings of the 2004 Workshop on Memory System Performance, ACM, New York, 2004, pp. 23 34.