A generic framework for approximation analysis of greedy algorithms for star bicoloring

DOI10.1080/10556788.2019.1649671zbMath1490.68300OpenAlexW2965878475MaRDI QIDQ5085266

Jeffrey S. Jones, David W. Juedes

Publication date: 27 June 2022

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

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

zbMATH Keywords

approximation algorithmsacyclic bicoloringstar bicoloring

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Uses Software

• ADOL-C
• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring
• The university of Florida sparse matrix collection
• Star coloring of graphs
• Computing a sparse Jacobian matrix by rows and columns
• Algorithm 755: ADOL-C
• The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

This page was built for publication: A generic framework for approximation analysis of greedy algorithms for star bicoloring