Linear-time LUP decomposition of forest-like matrices
From MaRDI portal
Recommendations
- Computing the inverse of a tree's incidence matrix
- Reducing the adjacency matrix of a tree
- An Almost Linear-Time Algorithm for Graph Realization
- Efficient algorithms for solving systems of linear equations and path problems
- An O(n^ 2) simplex algorithm for a class of linear programs with tree structure
Cites work
This page was built for publication: Linear-time LUP decomposition of forest-like matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963040)