A. H. Gebremedhin, F. Manne, and A. Pothen. Graph coloring in optimization revisited. Technical Report 226, University of Bergen, January 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Distance-k Coloring Algorithms for Numerical.. - Gebremedhin, Manne.. Self-citation (Gebremedhin Manne Pothen) (Correct)
....Coloring Algorithms for Numerical Optimization Assefaw Hadish Gebremedhin # Fredrik Manne Alex Pothen # Abstract Matrix partitioning problems that arise in the e#cient estimation of sparse Jacobians and Hessians can be modeled using variants of graph coloring problems. In a previous work [7], we argue that distance2 and distance graph coloring are robust and flexible formulations of the respective matrix estimation problems. The problem size in large scale optimization contexts makes the matrix estimation phase an expensive part of the entire computation both in terms of ....
....to be computed; whether a direct or a substitution method is employed; and whether only columns, or only rows, or both columns and rows are to be used to evaluate the matrix elements. In addition, the type of coloring problem depends on the kind of graph used to represent the underlying matrix. In [7], we provide an integrated review of previous works in this area and identify the distance 2 (D2) graph coloring problem as a unifying, generic, and robust formulation. The D2 coloring problem has also noteworthy applications in other fields such as channel assignment [11] and facility location ....
[Article contains additional citation context not shown here]
A. H. Gebremedhin, F. Manne, and A. Pothen. Graph coloring in optimization revisited. Technical Report 226, University of Bergen, Dept. of Informatics, Norway, January 2002. Available at: http://www.ii.uib.no/publikasjoner/texrap/.
Parallel Distance-k Coloring Algorithms for Numerical.. - Gebremedhin, Manne.. Self-citation (Gebremedhin Manne Pothen) (Correct)
....Albuquerque NM 87185 USA ICASE, NASA Langley Research Center, Hampton, VA 23681 2199 USA pothen cs.odu.edu Abstract. Matrix partitioning problems that arise in the e#cient estimation of sparse Jacobians and Hessians can be modeled using variants of graph coloring problems. In a previous work [6], we argue that distance 2 and distance graph coloring are robust and flexible formulations of the respective matrix estimation problems. The problem size in large scale optimization contexts makes the matrix estimation phase an expensive part of the entire computation both in terms of ....
....to be computed; whether a direct or a substitution method is employed; and whether only columns, or only rows, or both columns and rows are to be used to evaluate the matrix elements. In addition, the type of coloring problem depends on the kind of graph used to represent the underlying matrix. In [6], we provide an integrated review of previous works in this area and identify the distance 2 (D2) graph coloring problem as a unifying, generic, and robust formulation. The D2coloring problem has also noteworthy applications in other fields such as channel assignment [10] and facility location ....
[Article contains additional citation context not shown here]
A. H. Gebremedhin, F. Manne, and A. Pothen. Graph coloring in optimization revisited. Technical Report 226, University of Bergen, Dept. of Informatics, Norway, January 2002. Available at: http://www.ii.uib.no/publikasjoner/texrap/.
Robust Large-scale Parallel Nonlinear Solvers for Simulations - Bader, Pawlowski, Kolda (2005) (Correct)
No context found.
A. H. Gebremedhin, F. Manne, and A. Pothen. Graph coloring in optimization revisited. Technical Report 226, University of Bergen, January 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC