ColPack: Software for graph coloring and related problems in scientific computing

ACM Transactions on Mathematical Software

Volumn 40, Issue 1, 2013, Pages

  Gebremedhin, Assefaw H ^a   Nguyen, Duc ^a   Patwary, Md Mostofa Ali ^b   Pothen, Alex ^a  

^a PURDUE UNIVERSITY   (United States)

^b Northwestern University   (United States)

Author keywords

Automatic differentiation; Combinatorial optimization; Graph coloring; Greedy coloring algorithms; Nonlinear optimization; Sparse derivative computation; Vertex ordering techniques

Indexed keywords

AUTOMATIC DIFFERENTIATIONS; COLORING ALGORITHMS; GRAPH COLORINGS; NON-LINEAR OPTIMIZATION; VERTEX ORDERING;

COLORING; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; JACOBIAN MATRICES;

ALGORITHMS;

EID: 84885659337     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/2513109.2513110     Document Type: Article

References (53)

1. ALBERTSON, M.,CHAPPELL, G.,KIERSTEAD, H.,K?UNDGEN, A., AND RAMAMURTHI, R. 2004. Coloring with no 2-colored P4's. Electron. J. Combinatorics 11, 1, Article R26.
2. BHOWMICK, S. AND HOVLAND, P. 2008. Improving the performance of graph coloring algorithms through backtracking. In Proceedings of the International Conference on Computational Science. M. Bubak, G. vann Albada, J. Dongarra, and P. Sloot, Eds., Lecture Notes in Computer Science, vol. 5101, Springer Berlin, 873-882.
3. BOISVERT, R. F., POZO, R., AND REMINGTON, K. A. 1996. The Matrix Market formats: Initial Design. http://math.nist.gov/MatrixMarket/formats.html# MMformat.
4. BORODIN, O. 1979. On acyclic colorings of planar graphs. Discrete Math. 25, 211-236.
5. BOZDAǦ, D., CATALYUREK, U.,GEBREMEDHIN, A. H.,MANNE, F., BOMAN, E. G., AND OZGUNNER, F. 2010. Distributedmemory parallel algorithms for distance-2 coloring and related problems in derivative computation. SIAM J. Sci.Comput. 32, 4, 2418-2446.
6. BOZDAǦ, D.,GEBREMEDHIN, A. H.,MANNE, F.,BOMAN, E. G., AND CATALYUREK, U. V. 2008. A framework for scalable greedy coloring on distributed-memory parallel computers. J. Parallel Distrib. Comput. 68, 4, 515-535.
7. BŔeLAZ, D. 1979. New methods to color the vertices of a graph. Comm. ACM 22, 4, 251-256.
8. CATALYUREK, U., FEO, J., GEBREMEDHIN, A., HALAPPANAVAR, M., AND POTHEN, A. 2012. Graph coloring algorithms for multicore and massively multhithreaded architectures. Parallel Comput. 38, 576-594.
9. CHAITIN, G., AUSLANDER, M., CHANDRA, A., COCKE, J., HOPKINS, M., AND MARKSTEIN, P. 1981. Register allocation via coloring. Comput. Lang. 6, 47-57.
10. CHAKRABARTI, D. AND FALOUTSOS, C. 2006. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 38, 1, 2.
11. COLEMAN, T. AND CAI, J. 1986. The cyclic coloring problem and estimation of sparse Hessian matrices. SIAM J. Alg. Disc. Meth. 7, 2, 221-235.
12. COLEMAN, T., GARBOW, B., AND MOŔe, J. 1984. Software for estimating sparse Jacobian matrices. ACM Trans. Math. Softw. 10, 329-347.
13. COLEMAN, T., GARBOW, B., AND MOŔe, J. 1985. Software for estimating sparse Hessian matrices. ACM Trans. Math. Softw. 11, 363-377.
14. COLEMAN, T. AND MOŔe, J. 1983. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20, 1, 187-209.
15. COLEMAN, T. AND MOŔe, J. 1984. Estimation of sparse Hessian matrices and graph coloring problems. Math. Program. 28, 243-270.
16. COLEMAN, T. AND VERMA, A. 1998. The efficient computation of sparse Jacobian matrices using automatic differentiation. SIAM J. Sci. Comput. 19, 4, 1210-1233.
17. CULBERSON, J. C. 1992. Iterated greedy graph coloring and the difficulty landscape. Tech. rep. TR 92-07, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada.
18. CURTIS, A., POWELL, M., AND REID, J. 1974. On the estimation of sparse Jacobian matrices. J. Inst. Math. Appl. 13, 117-119.
19. DAVIS, T. A. AND HU, Y. 2011. The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38, 1, 1:1-1:25.
20. DEVITO, Z., JOUBERT, N., ET AL. 2011. Liszt: A domain specific language for building portable mesh-based PDE solvers. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis.
21. DIESTEL, R. 2000. Graph Theory 2nd Ed. Springer, New York.
22. DUFF, I. S. 1992. User's guide for the Harwell-Boeing sparse matrix collection. http://math.nist.gov/ MatrixMarket/formats.html#hb.
23. ERDÖS, P. AND HAJNAL, A. 1966. On chromatic number of graphs and set systems. Acta. Math. Acad. Sci. Hungar 17, 61-99.
24. FINCK, H. AND SACHS, H. 1969. Ü ber eine von H.S. Wilf angegebene Schranke fu? r die chromatische Zahl endlicher Graphen. Math. Nachr. 39, 373-386.
25. GEBREMEDHIN, A.,MANNE, F., AND POTHEN, A. 2005. What color is your Jacobian? Graph coloring for computing derivatives. SIAM Rev. 47, 4, 629-705.
26. GEBREMEDHIN, A., POTHEN, A., TARAFDAR, A., AND WALTHER, A. 2009. Efficient computation of sparse Hessians using coloring and automatic differentiation. INFORMS J. Comput. 21, 2, 209-223.
27. GEBREMEDHIN, A., POTHEN, A., AND WALTHER, A. 2008. Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: Acase study in a Simulated Moving Bed process. In Advances in Automatic Differentiation, C. Bischof et al., Ed., Lecture Notes in Computational Science and Engineering, vol. 64, Springer, 339-349.
28. GEBREMEDHIN, A., TARAFDAR, A., MANNE, F., AND POTHEN, A. 2007. New acyclic and star coloring algorithms with applications to Hessian computation. SIAM J. Sci. Comput. 29, 1042-1072.
29. GRIEWANK, A., JUEDES, D., AND UTKE, J. 1996. ADOL-C: A package for the automatic differentiation of algorithms written in C/C++. ACM Trans. Math. Softw. 22, 131-167.
30. GRIEWANK, A. AND WALTHER, A. 2008. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation 2nd Ed. SIAM, Philadelphia, PA.
31. HALL, J.,HARTLINE, J., KARLIN, A., SAIA, J., AND WILKES, J. 2001. On algorithms for efficient data migration. In Proceedings of the 12th Annual ACM-SIAM Symp. on Discrete Algorithms. 620-629.
32. HASAN, M., HOSSAIN, S., AND STEIHAUG, T. 2009. DSJM: A software toolkit for direct determination of sparse Jacobian matrices. Extended Abstract at the International Conference on Scientific Computing, SIAM Workshop on Combinatorial Scientific Computing.
33. HOSSAIN, S. AND STEIHAUG, T. 1998. Computing a sparse Jacobian matrix by rows and columns. Optimization Meth. Softw. 10, 33-48.
34. HOSSAIN, S. AND STEIHAUG, T. 2012. Optimal direct determination of sparse Jacobian matrices. Optimization Meth. Softw. DOI:10.1080/10556788.2012.693927.
35. JONES, M. AND PLASSMANN, P. 1994. Scalable iterative solution of sparse linear systems. Parallel Comput. 20, 5, 753-773.
36. KARYPIS, G. AND KUMAR, V. 1998. MeTiS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. http://people.sc.fsu.edu/~burkardt/ data/metisgraph/metisgraph.html.
37. KRUMKE, S., MARATHE, M., AND RAVI, S. 2001. Models and approximation algorithms for channel assignment in radio networks. Wirel. Networks 7, 6, 567-574.
38. LICK, D. AND WHITE, A. 1970. k-degenerate graphs. Canad. J. Math. 22, 1082-1096.
39. MATULA, D. 1968. A max-min theorem for graphs with application to graph coloring. SIAM Rev. 10, 481-482.
40. MATULA, D.,MARBLE, G., AND ISAACSON, J. 1972. Graph coloring algorithms. In Graph Theory and Computing, R. Read, Ed., Academic Press, New York, 109-122.
41. MCCORMICK, S. 1983. Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Program. 26, 153-171.
42. MORGENSTERN, C. A. AND SHAPIRO, H. D. 1991. Heuristics for rapidly four-coloring large planar graphs. Algorithmica 6, 6, 869-891.
43. NARAYANAN, S. H. K., NORRIS, B., AND WINNICKA, B. 2010. ADIC2: Development of a component source transformation system for differentiating C and C++. Procedia Comput. Sci. 1, 1, 1845-1853.
44. NAUMANN, U. 2012. The Art of Differentiating Computer Programs: An Introduction to Algorithmic Differentiation. Software, Environments, and Tools. SIAM, Philadelphia, PA.
45. PATWARY, M. M. A., GEBREMEDHIN, A. H., AND POTHEN, A. 2011. New multithreaded ordering and coloring algorithms for multicore architectures. In Proceedings of the International Euro-Par Conference on Parallel Processing. E. Jeannot, R. Namyst, and J. Roman, Eds., Lecture Notes in Computer Science, vol. 6853, Springer, 250-262.
46. POWELL, M. AND TOINT, P. 1979. On the estimation of sparse Hessian matrices. SIAM J. Numer. Anal. 16, 6, 1060-1074.
47. SAAD, Y. 1996. ILUM: A multi-elimination ILU preconditioner for general sparse matrices. SIAM J. Sci. Comput. 17, 830-847.
48. SIEFERT, C. AND STURLER, E. 2006. Probing methods for generalized saddle-point problems. Electron. Trans. Numer. Anal. 22, 163-183.
49. SZEKERES, G. ANDWILF, H. 1968. An inequality for the chromatic number of a graph. J. Combin. Theory 4, 1-3.
50. TURNER, J. 1988. Almost all k-colorable graphs are easy to color. J. Algor. 9, 63-82.
51. WALTHER, A. AND GRIEWANK, A. 2012. Getting started with ADOL-C. In Combinatorial Scientific Computing, Chapman-Hall CRC Computational Science, 7, 181-202.
52. WELSH, D. AND POWELL, M. 1967. An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10, 85-86.
53. ZUCKERMAN, D. 2007. Linear degree extractors and the inapproximability ofmax clique and chromatic number. Theory Comput. 3, 103-128.