Graph coloring in the estimation of sparse derivative matrices: Instances and applications
From MaRDI portal
Publication:2467363
DOI10.1016/J.DAM.2006.07.018zbMATH Open1130.65046OpenAlexW2158898837MaRDI QIDQ2467363FDOQ2467363
Authors: Shahadat Hossain, Trond Steihaug 
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
Recommendations
- Estimation of sparse hessian matrices and graph coloring problems
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- A GRASP for coloring sparse graphs
- On coloring of sparse graphs
- Colouring graphs with sparse neighbourhoods: bounds and applications
- A note on coloring sparse random graphs
- Approximate graph coloring by semidefinite programming
- Spectral sparsification of graphs
- Linear coloring of sparse graphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Frozen development in graph coloring
- Another look at graph coloring via propositional satisfiability
- Estimation of sparse hessian matrices and graph coloring problems
- New methods to color the vertices of a graph
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Title not available (Why is that?)
- Global Continuation for Distance Geometry Problems
- Title not available (Why is that?)
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- Optimal direct determination of sparse Jacobian matrices
- Estimation of Sparse Jacobian Matrices
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
- Computing a sparse Jacobian matrix by rows and columns
- Title not available (Why is that?)
- Detecting Jacobian sparsity patterns by Bayesian probing
Cited In (10)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- CsegGraph: a graph colouring instance generator
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- The independent set perturbation adjoint method: a new method of differentiating mesh-based fluids models
- Regular pattern-free coloring
- Another look at graph coloring via propositional satisfiability
- Optimal direct determination of sparse Jacobian matrices
- Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring
Uses Software
This page was built for publication: Graph coloring in the estimation of sparse derivative matrices: Instances and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467363)
