Graph coloring in the estimation of sparse derivative matrices: Instances and applications

DOI10.1016/J.DAM.2006.07.018MaRDI QIDQ2467363zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical examplessparsitygraph coloringderivative matricesexact coloringmathematical derivatives

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Numerical differentiation (65D25)

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
• 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

• scientific article; zbMATH DE number 1694753 (Why is no real title available?)
• scientific article; zbMATH DE number 3898623 (Why is no real title available?)
• scientific article; zbMATH DE number 1456803 (Why is no real title available?)
• scientific article; zbMATH DE number 3430031 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Another look at graph coloring via propositional satisfiability
• Computing a sparse Jacobian matrix by rows and columns
• Detecting Jacobian sparsity patterns by Bayesian probing
• Estimation of Sparse Jacobian Matrices
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Estimation of sparse hessian matrices and graph coloring problems
• Frozen development in graph coloring
• Global Continuation for Distance Geometry Problems
• New methods to color the vertices of a graph
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• Optimal direct determination of sparse Jacobian matrices
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
• The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

Cited in

(11)

• Optimal direct determination of sparse Jacobian matrices
• ColPack, software for graph coloring and related problems in scientific computing
• A new approach to the vertex coloring problem
• Graph models and their efficient implementation for sparse Jacobian matrix determination
• CsegGraph: a graph colouring instance generator
• Regular pattern-free coloring
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
• Another look at graph coloring via propositional satisfiability
• Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring
• The independent set perturbation adjoint method: a new method of differentiating mesh-based fluids models

Describes a project that uses

Uses Software

• CsegGraph
• IML++
• ve08

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)