The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
From MaRDI portal
(Redirected from Publication:4720697)
Recommendations
Cites work
- Computing Forward-Difference Intervals for Numerical Optimization
- Estimation of sparse hessian matrices and graph coloring problems
- Estimation of Sparse Jacobian Matrices
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3430031 (Why is no real title available?)
- Large sparse numerical optimization
- On the Estimation of Sparse Hessian Matrices
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations
- 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
(39)- Acyclic edge coloring of planar graphs with large girth
- A chordal preconditioner for large-scale optimization
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
- Acyclic colorings of graph subdivisions revisited
- Acyclic edge coloring of graphs with large girths
- Acyclic improper colouring of graphs with maximum degree 4
- Acyclic edge coloring of planar graphs without cycles of specific lengths
- On acyclically 4-colorable maximal planar graphs
- Acyclic edge coloring of planar graphs with girth at least 5
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- Acyclic coloring of graphs with maximum degree 7
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
- Optimal direct determination of sparse Jacobian matrices
- Coloring Jacobians revisited: a new algorithm for star and acyclic bicoloring
- Estimation of sparse hessian matrices and graph coloring problems
- Acyclic coloring with few division vertices
- Restricted coloring problems on graphs with few P₄'s
- A local lemma for focused stochastic algorithms
- Improved bounds for acyclic chromatic index of planar graphs
- Solving nonlinear equations with the Newton-Krylov method based on automatic differentiation
- scientific article; zbMATH DE number 7651161 (Why is no real title available?)
- A polyhedral study of the acyclic coloring problem
- A polyhedral study of the acyclic coloring problem
- Acyclic, star, and injective colouring: bounding the diameter
- Acyclic 3-coloring of generalized Petersen graphs
- Star chromatic number of some graph products
- Hardness transitions and uniqueness of acyclic colouring
- k-forested coloring of planar graphs with large girth
- Acyclic and star colorings of cographs
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
- Acyclic, star and injective colouring: a complexity picture for H-free graphs
- Acyclically 3-colorable planar graphs
- Fixed-sparsity matrix approximation from matrix-vector products
- Quasi-optimal hierarchically semi-separable matrix approximation
- A recursive butterfly factorization with optimality guarantees
- \(k\)-forested choosability of planar graphs and sparse graphs
- Matrix-free preconditioning using partial matrix estimation
- Acyclic coloring of graphs without bichromatic long path
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)
