The Null Space Problem II. Algorithms
- 1 October 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 8 (4), 544-563
- https://doi.org/10.1137/0608045
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Computing a Sparse Basis for the Null SpaceSIAM Journal on Algebraic Discrete Methods, 1987
- The Null Space Problem I. ComplexitySIAM Journal on Algebraic Discrete Methods, 1986
- Predicting fill for sparse orthogonal factorizationJournal of the ACM, 1986
- An algorithm to compute a sparse basis of the null spaceNumerische Mathematik, 1985
- Estimation of sparse hessian matrices and graph coloring problemsMathematical Programming, 1984
- Estimation of Sparse Jacobian Matrices and Graph Coloring BlemsSIAM Journal on Numerical Analysis, 1983
- Algorithms for Generating Fundamental Cycles in a GraphACM Transactions on Mathematical Software, 1982
- On Algorithms for Obtaining a Maximum TransversalACM Transactions on Mathematical Software, 1981
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973