BACK TO INDEX
|
Publications about 'Coloring' on CSC
|
|
Articles in journal or book chapters
|
-
A. H. Gebremedhin,
F. Manne,
and A. Pothen.
What color is your Jacobian? Graph coloring for computing derivatives.
SIAM Review,
47(4):629-705,
2005.
-
B. Hendrickson and A. Pothen.
Combinatorial scientific computing: The enabling power of discrete algorithms in computational science.
In M. Dayde,
M. L. M. Palma,
L. G. A. Coutinho,
E. Pacitti,
and J. C. Lopes, editors,
High Performance Computing for Computational Science---VECPAR 2006,
volume 4395 of Lecture Notes in Computer Science,
pages 260-280,
2007.
Keyword(s): Minimum degree ordering algorithm,
Coloring,
Jacobian matrix,
Sparse Hessian matrix.
-
D. Bozdag,
Ü. V. Çatalyürek,
A. H. Gebremedhin,
F. Manne,
E. G. Boman,
and F. Özgüner.
A parallel distance-2 graph coloring algorithm for distributed memory computers.
In L. T. Yang,
O. F. Rana,
B. Di Martino,
and J. Dongarra, editors,
Proceedings of 2005 International Conference on High Performance Computing and Communications (HPCC-05),
volume 3726 of Lecture Notes in Computer Science,
pages 796-806,
2005.
BACK TO INDEX
Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.