The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
From MaRDI portal
Publication:4720697
DOI10.1137/0607026zbMath0613.65066OpenAlexW2124855066WikidataQ56390801 ScholiaQ56390801MaRDI QIDQ4720697
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
graph coloringNP-complete problemsunconstrained minimizationoptimization algorithmssparsitysubstitution methodssparse Hessian matricesnumerical differences
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Related Items
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring, Acyclic colorings of graphs with bounded degree, Matrix-free preconditioning using partial matrix estimation, Acyclic coloring of graphs with maximum degree 7, Acyclic coloring with few division vertices, Acyclic coloring of graphs without bichromatic long path, Acyclic colorings of graph subdivisions revisited, Acyclic edge coloring of graphs with large girths, Star chromatic number of some graph products, Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation, Hardness transitions and uniqueness of acyclic colouring, Unnamed Item, \(k\)-forested coloring of planar graphs with large girth, Acyclic and star colorings of cographs, Acyclic edge coloring of planar graphs with girth at least 5, Restricted coloring problems on graphs with few \(P_4\)'s, Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs, Graph coloring in the estimation of sparse derivative matrices: Instances and applications, Acyclic edge coloring of planar graphs without cycles of specific lengths, Improved bounds for acyclic chromatic index of planar graphs, Acyclically 3-colorable planar graphs, A polyhedral study of the acyclic coloring problem, Solving nonlinear equations with the Newton–Krylov method based on automatic differentiation, Acyclic improper colouring of graphs with maximum degree 4, A polyhedral study of the acyclic coloring problem, Acyclic 3-coloring of generalized Petersen graphs, Acyclic, star, and injective colouring: bounding the diameter, A chordal preconditioner for large-scale optimization, Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope, \(k\)-forested choosability of planar graphs and sparse graphs, On acyclically 4-colorable maximal planar graphs, Acyclic edge coloring of planar graphs with large girth, Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope, A Local Lemma for Focused Stochastic Algorithms, Optimal direct determination of sparse Jacobian matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Large sparse numerical optimization
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations
- Estimation of Sparse Jacobian Matrices
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
- Software for estimating sparse Jacobian matrices
- Computing Forward-Difference Intervals for Numerical Optimization
- Estimation of sparse hessian matrices and graph coloring problems
- Smallest-last ordering and clustering and graph coloring algorithms
- On the Estimation of Sparse Hessian Matrices
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
