On constructing the elimination tree

DOI10.1016/0166-218X(94)90121-XzbMath0801.68135MaRDI QIDQ1314332

Yunzhou Zhu, David Mutchler

Publication date: 22 February 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimum spanning treeelimination treeCholesky factor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Symbolic Cholesky factorization on a local-memory multiprocessor
• The Role of Elimination Trees in Sparse Factorization
• A compact row storage scheme for Cholesky factors using elimination trees
• Efficiency of a Good But Not Linear Set Union Algorithm
• Algorithmic Aspects of Vertex Elimination on Graphs
• An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization

This page was built for publication: On constructing the elimination tree