On constructing the elimination tree
From MaRDI portal
Recommendations
- Elimination trees and the construction of pools and stacks
- On eliminating vertices from a tree
- Methods for constructing balanced elimination trees and other recursive decompositions
- Constructing a minimum height elimination tree of a tree in linear time
- scientific article; zbMATH DE number 1844471
- A Note on the Column Elimination Tree
- scientific article; zbMATH DE number 3891405
- scientific article; zbMATH DE number 1894708
- scientific article; zbMATH DE number 7267318
- Constructing elimination trees for sparse unsymmetric matrices
Cites work
- A compact row storage scheme for Cholesky factors using elimination trees
- Algorithmic Aspects of Vertex Elimination on Graphs
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
- Efficiency of a Good But Not Linear Set Union Algorithm
- Symbolic Cholesky factorization on a local-memory multiprocessor
- The Role of Elimination Trees in Sparse Factorization
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Cited in
(8)- Finding minimum height elimination trees for interval graphs in polynomial time
- Constructing elimination trees for sparse unsymmetric matrices
- scientific article; zbMATH DE number 3843059 (Why is no real title available?)
- The Role of Elimination Trees in Sparse Factorization
- An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
- A Note on the Column Elimination Tree
- scientific article; zbMATH DE number 1844471 (Why is no real title available?)
- Constructing a minimum height elimination tree of a tree in linear time
This page was built for publication: On constructing the elimination tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314332)