Minimizing elimination tree height can increase fill more than linearly

DOI10.1016/0020-0190(95)90815-IzbMath0875.68695OpenAlexW2031013415MaRDI QIDQ671941

Bengt Aspvall

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)90815-i

zbMATH Keywords

Parallel processingChordal completionElimination treeFillSparse matrixVertex elimination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear equations (linear algebraic aspects) (15A06)

Related Items (1)

Constructing a minimum height elimination tree of a tree in linear time

Cites Work

• The Role of Elimination Trees in Sparse Factorization
• Parallel Algorithms for Sparse Linear Systems
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Unnamed Item

This page was built for publication: Minimizing elimination tree height can increase fill more than linearly