Pages that link to "Item:Q4745216"
From MaRDI portal
The following pages link to Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (Q4745216):
Displayed 15 items.
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Making sparse matrices sparser: Computational results (Q751503) (← links)
- \(L(h,1,1)\)-labeling of outerplanar graphs (Q1014311) (← links)
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
- A hierarchical algorithm for making sparse matrices sparser (Q1207308) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Principal structure of submodular systems and Hitchcock-type independent flows (Q1906849) (← links)
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods (Q3324531) (← links)
- Estimation of sparse hessian matrices and graph coloring problems (Q3690096) (← links)
- (Q3806696) (← links)
- Computing a sparse Jacobian matrix by rows and columns (Q4227925) (← links)
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices (Q4720697) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)