The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
DOI10.1137/0607026zbMATH Open0613.65066OpenAlexW2124855066WikidataQ56390801 ScholiaQ56390801MaRDI QIDQ4720697FDOQ4720697
Authors: Thomas F. Coleman, Jin-Yi Cai 
Publication date: 1986
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6485
Recommendations
sparsitygraph coloringNP-complete problemsoptimization algorithmsunconstrained minimizationsubstitution methodssparse Hessian matricesnumerical differences
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- Title not available (Why is that?)
- Smallest-last ordering and clustering and graph coloring algorithms
- Estimation of sparse hessian matrices and graph coloring problems
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Title not available (Why is that?)
- On the Estimation of Sparse Hessian Matrices
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- Large sparse numerical optimization
- Estimation of Sparse Jacobian Matrices
- Software for estimating sparse Jacobian matrices
- Computing Forward-Difference Intervals for Numerical Optimization
- Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
Cited In (36)
- 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
- A Local Lemma for Focused Stochastic Algorithms
- Acyclic and star colorings of cographs
- Acyclic, star, and injective colouring: bounding the diameter
- Acyclic coloring of graphs with maximum degree 7
- Acyclic colourings of graphs with bounded degree
- 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
- Solving nonlinear equations with the Newton–Krylov method based on automatic differentiation
- Star chromatic number of some graph products
- Restricted coloring problems on graphs with few \(P_4\)'s
- Title not available (Why is that?)
- 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
- 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)
