Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (Q4745216)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal approximation of sparse hessians and its equivalence to a graph coloring problem |
scientific article; zbMATH DE number 3800878
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal approximation of sparse hessians and its equivalence to a graph coloring problem |
scientific article; zbMATH DE number 3800878 |
Statements
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (English)
0 references
1983
0 references
sparse Hessian approximation
0 references
graph coloring heuristics
0 references
elimination methods
0 references
NP-complete
0 references
direct methods
0 references
