The role of graph structures in the theory of local elimination algorithms

zbMATH Open1164.90021MaRDI QIDQ3607914FDOQ3607914

Authors: Oleg A. Shcherbina 

Publication date: 28 February 2009

Recommendations

• 10.1007/s11470-008-1012-8
• The Role of Elimination Trees in Sparse Factorization
• scientific article; zbMATH DE number 1844471
• Elimination Structures for Unsymmetric Sparse $LU$ Factors
• Methods for constructing balanced elimination trees and other recursive decompositions

zbMATH Keywords

graph structureselimination treeselimination graphslocal elimination algorithms

Mathematics Subject Classification ID

Dynamic programming (90C39) Integer programming (90C10) Decomposition methods (49M27)

Cited In (2)

• 10.1007/s11470-008-1012-8
• Localization of edges in graph models of two-level algorithms

This page was built for publication: The role of graph structures in the theory of local elimination algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3607914)