Optimal approximation of sparse hessians and its equivalence to a graph coloring problem (Q4745216): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of Sparse Jacobian Matrices and Graph Coloring Blems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Estimation of Sparse Hessian Matrices / rank
 
Normal rank

Revision as of 17:22, 13 June 2024

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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references