Pages that link to "Item:Q2467363"
From MaRDI portal
The following pages link to Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363):
Displaying 9 items.
- Regular pattern-free coloring (Q2172395) (← links)
- Graph models and their efficient implementation for sparse Jacobian matrix determination (Q2446302) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices (Q2819230) (← links)
- Optimal direct determination of sparse Jacobian matrices (Q2867431) (← links)
- Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring (Q2885476) (← links)
- The independent set perturbation adjoint method: A new method of differentiating mesh-based fluids models (Q3011096) (← links)
- CsegGraph: a graph colouring instance generator (Q3643182) (← links)