Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring

DOI10.1080/10556788.2011.606575zbMath1253.68362OpenAlexW2004380037MaRDI QIDQ2885476

David W. Juedes, Jeffrey S. Jones

Publication date: 23 May 2012

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2011.606575

zbMATH Keywords

automatic differentiationapproximation algorithmsacyclic bicoloringstar bicoloring

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

A generic framework for approximation analysis of greedy algorithms for star bicoloring ⋮ Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds ⋮ Approximation algorithms in combinatorial scientific computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A still better performance guarantee for approximate graph coloring
• Zero knowledge and the chromatic number
• Graph coloring in the estimation of sparse derivative matrices: Instances and applications
• New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
• OpenAD/F
• Estimation of sparse hessian matrices and graph coloring problems
• Recipes for adjoint code construction
• Computing a sparse Jacobian matrix by rows and columns
• On the hardness of approximating minimization problems
• Algorithm 755: ADOL-C
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

This page was built for publication: Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring