Cited in
(44)- A benchmark of selected algorithmic differentiation tools on some problems in computer vision and machine learning
- Acyclically 3-colorable planar graphs
- Acyclic improper colouring of graphs with maximum degree 4
- The complexity of restricted star colouring
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
- ColPack, software for graph coloring and related problems in scientific computing
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
- A polyhedral investigation of star colorings
- Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
- On acyclically 4-colorable maximal planar graphs
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
- A framework for parallel second order incremental optimization algorithms for solving partially separable problems
- Acyclic coloring of graphs with maximum degree 7
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- On efficient Hessian computation using the edge pushing algorithm in Julia
- A computationally efficient fixed point approach to dynamic structural demand estimation
- CsegGraph
- ADiMat
- A polyhedral study of the acyclic coloring problem
- ADIC2
- PLuTo
- edge_push_sp
- hess_pat
- DSJM
- CYCLADES
- Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation
- JuMP: a modeling language for mathematical optimization
- Livarh
- Livarhacc
- On the efficient computation of sparsity patterns for Hessians
- Efficient computation of sparse hessians using coloring and automatic differentiation
- Higher-order reverse automatic differentiation with emphasis on the third-order
- \(\mathcal Q\)-Ramsey classes of graphs
- Lazy K-way linear combination kernels for efficient runtime sparse Jacobian matrix evaluations in C++
- Implementation of partial separability in a source-to-source transformation AD tool
- Packing, partitioning, and covering symresacks
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- Tenscalc
- Acyclic 3-coloring of generalized Petersen graphs
- Pattern graph for sparse Hessian matrix
- scientific article; zbMATH DE number 6982909 (Why is no real title available?)
- Acyclic coloring with few division vertices
- Acyclic colorings of graph subdivisions revisited
This page was built for software: ColPack
