New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
From MaRDI portal
Publication:3506547
DOI10.1137/050639879zbMath1140.05304OpenAlexW2018995959MaRDI QIDQ3506547
Arijit Tarafdar, Fredrik Manne, Alex Pothen, Assefaw Hadish Gebremedhin
Publication date: 16 June 2008
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050639879
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (20)
Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring ⋮ A polyhedral investigation of star colorings ⋮ Star coloring of graphs with girth at least five ⋮ The complexity of restricted star colouring ⋮ Star coloring of cubic graphs ⋮ Star chromatic number of some graph products ⋮ Packing, partitioning, and covering symresacks ⋮ The complexity of star colouring in bounded degree graphs and regular graphs ⋮ Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation ⋮ Hardness transitions and uniqueness of acyclic colouring ⋮ Star coloring of certain graph classes ⋮ Acyclic and star colorings of cographs ⋮ Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs ⋮ An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs ⋮ On efficient Hessian computation using the edge pushing algorithm in Julia ⋮ Pattern graph for sparse Hessian matrix determination ⋮ A polyhedral study of the acyclic coloring problem ⋮ Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
Uses Software
This page was built for publication: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
