New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- 1 January 2007
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 29 (3) , 1042-1072
- https://doi.org/10.1137/050639879
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The Distance-2 Matching Problem and Its Relationship to the MAC-Layer Capacity of Ad Hoc Wireless NetworksIEEE Journal on Selected Areas in Communications, 2004
- Coloring with no $2$-Colored $P_4$'sThe Electronic Journal of Combinatorics, 2004
- Coloring Powers of Planar GraphsSIAM Journal on Discrete Mathematics, 2003
- The Cyclic Coloring Problem and Estimation of Sparse Hessian MatricesSIAM Journal on Algebraic Discrete Methods, 1986
- Software for estimating sparse Hessian matricesACM Transactions on Mathematical Software, 1985
- Estimation of sparse hessian matrices and graph coloring problemsMathematical Programming, 1984
- Software for estimating sparse Jacobian matricesACM Transactions on Mathematical Software, 1984
- CHARMM: A program for macromolecular energy, minimization, and dynamics calculationsJournal of Computational Chemistry, 1983
- Estimation of Sparse Jacobian Matrices and Graph Coloring BlemsSIAM Journal on Numerical Analysis, 1983
- On acyclic colorings of planar graphsDiscrete Mathematics, 1979