New Acyclic and Star Coloring Algorithms with Application to Computing Hessians¶
Gebremedhin, T., Manne, & Pothen. (2007). New Acyclic and Star Coloring Algorithms with Application to Computing Hessians. SIAM Journal on Scientific Computing, 1042-1072.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Acyclic Coloring
- This is a restriction on a completed proper coloring, whether the graph models a planar mathematical object or the sparsity pattern of a matrix.
This sourceThese are graph algorithm tests, not proof of overall Hessian runtime gains.
- This is a restriction on a completed proper coloring, whether the graph models a planar mathematical object or the sparsity pattern of a matrix.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:ca9b3d80158f · see in the full table