Graph coloring in the estimation of sparse derivative matrices: Instances and applications
From MaRDI portal
Publication:2467363
DOI10.1016/j.dam.2006.07.018zbMath1130.65046OpenAlexW2158898837MaRDI QIDQ2467363
Trond Steihaug, Shahadat Hossain
Publication date: 21 January 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.018
Related Items
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring ⋮ Regular pattern-free coloring ⋮ Graph models and their efficient implementation for sparse Jacobian matrix determination ⋮ Another look at graph coloring via propositional satisfiability ⋮ The independent set perturbation adjoint method: A new method of differentiating mesh-based fluids models ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices ⋮ CsegGraph: a graph colouring instance generator ⋮ Optimal direct determination of sparse Jacobian matrices
Uses Software
Cites Work
- Detecting Jacobian sparsity patterns by Bayesian probing
- Another look at graph coloring via propositional satisfiability
- Optimal direct determination of sparse Jacobian matrices
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Estimation of Sparse Jacobian Matrices
- Estimation of sparse hessian matrices and graph coloring problems
- New methods to color the vertices of a graph
- Computing a sparse Jacobian matrix by rows and columns
- Global Continuation for Distance Geometry Problems
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Frozen development in graph coloring
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
