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):
Displaying 35 items.
- Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids (Q396591) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
- 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)
- Full spark frames (Q1934656) (← links)
- The complexity of frugal colouring (Q2023759) (← links)
- Further results on 2-distance coloring of graphs (Q2099385) (← links)
- Graph clustering via generalized colorings (Q2136276) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q2154095) (← links)
- Contention-free MAC protocols for asynchronous wireless sensor networks (Q2377249) (← links)
- Graph models and their efficient implementation for sparse Jacobian matrix determination (Q2446302) (← links)
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
- Optimal direct determination of sparse Jacobian matrices (Q2867431) (← links)
- Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring (Q2885476) (← links)
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods (Q3324531) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- Estimation of sparse hessian matrices and graph coloring problems (Q3690096) (← links)
- A note on direct methods for approximations of sparse Hessian matrices (Q3806696) (← links)
- Computing a sparse Jacobian matrix by rows and columns (Q4227925) (← links)
- Pattern graph for sparse Hessian matrix determination (Q4685608) (← links)
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices (Q4720697) (← links)
- On (<i>s,t</i>)-relaxed <i>L</i>(1,1)-labelling of trees (Q4976318) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- 2-Distance chromatic number of some graph products (Q5854751) (← links)
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs (Q6069154) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q6090539) (← links)
- Physics-based preconditioning of Jacobian-free Newton-Krylov solver for Navier-Stokes equations using nodal integral method (Q6574151) (← links)
