The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices

sparsity graph coloring NP-complete problems optimization algorithms unconstrained minimization substitution methods sparse Hessian matrices numerical differences

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)

Recommendations

Estimation of sparse hessian matrices and graph coloring problems
A note on direct methods for approximations of sparse Hessian matrices
scientific article; zbMATH DE number 3936369
Efficient detection of Hessian matrix sparsity pattern
Pattern graph for sparse Hessian matrix

Cites Work

scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 3430031 (Why is no real title available?)
Computing Forward-Difference Intervals for Numerical Optimization
Estimation of Sparse Jacobian Matrices
Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
Estimation of sparse hessian matrices and graph coloring problems
Large sparse numerical optimization
On the Estimation of Sparse Hessian Matrices
Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
Smallest-last ordering and clustering and graph coloring algorithms
Software for estimating sparse Jacobian matrices

Cited In (35)

Improved bounds for acyclic chromatic index of planar graphs
Acyclic coloring with few division vertices
Hardness transitions and uniqueness of acyclic colouring
A polyhedral study of the acyclic coloring problem
A polyhedral study of the acyclic coloring problem
Matrix-free preconditioning using partial matrix estimation
Acyclic edge coloring of graphs with large girths
Acyclically 3-colorable planar graphs
Acyclic and star colorings of cographs
Acyclic, star, and injective colouring: bounding the diameter
Acyclic coloring of graphs with maximum degree 7
Acyclic colorings of graph subdivisions revisited
Acyclic edge coloring of planar graphs with girth at least 5
A chordal preconditioner for large-scale optimization
Acyclic coloring of graphs without bichromatic long path
On acyclically 4-colorable maximal planar graphs
\(k\)-forested coloring of planar graphs with large girth
Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
\(k\)-forested choosability of planar graphs and sparse graphs
Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
A local lemma for focused stochastic algorithms
Star chromatic number of some graph products
Restricted coloring problems on graphs with few \(P_4\)'s
Title not available (Why is no real title available?)
Acyclic improper colouring of graphs with maximum degree 4
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
Acyclic edge coloring of planar graphs without cycles of specific lengths
Optimal direct determination of sparse Jacobian matrices
Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring
Solving nonlinear equations with the Newton-Krylov method based on automatic differentiation
Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
Estimation of sparse hessian matrices and graph coloring problems
Acyclic edge coloring of planar graphs with large girth
Acyclic 3-coloring of generalized Petersen graphs

This page was built for publication: The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4720697)