Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
From MaRDI portal
Publication:4745216
DOI10.1007/BF02592052zbMath0507.65027OpenAlexW1988783936MaRDI QIDQ4745216
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592052
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring, A polynomial time algorithm for strong edge coloring of partial \(k\)-trees, Graph clustering via generalized colorings, Contention-free MAC protocols for asynchronous wireless sensor networks, On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations, The complexity of \(L(p, q)\)-edge-labelling, A note on direct methods for approximations of sparse Hessian matrices, Principal structure of submodular systems and Hitchcock-type independent flows, Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids, Full spark frames, An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs, On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs, Graph models and their efficient implementation for sparse Jacobian matrix determination, Tree-like distance colouring for planar graphs of sufficient girth, Graph coloring in the estimation of sparse derivative matrices: Instances and applications, Optimization of unconstrained functions with sparse hessian matrices-newton-type methods, A hierarchical algorithm for making sparse matrices sparser, On distance constrained labeling of disk graphs, The complexity of \(L(p, q)\)-edge-labelling, On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs, The complexity of frugal colouring, Pattern graph for sparse Hessian matrix determination, \(L(h,1,1)\)-labeling of outerplanar graphs, Making sparse matrices sparser: Computational results, On (s,t)-relaxed L(1,1)-labelling of trees, The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices, The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree, Approximation algorithms in combinatorial scientific computing, 2-Distance chromatic number of some graph products, Computing a sparse Jacobian matrix by rows and columns, Further results on 2-distance coloring of graphs, Optimal direct determination of sparse Jacobian matrices, On the computational complexity of strong edge coloring, Estimation of sparse hessian matrices and graph coloring problems
Cites Work
