A note on bipartite graphs and pivot selection in sparse matrices
- 1 December 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 23 (12), 817-821
- https://doi.org/10.1109/tcs.1976.1084160
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrixJournal of Mathematical Analysis and Applications, 1976
- Bipartite network associated with optimal pivoting problemInternational Journal of Circuit Theory and Applications, 1975
- An optimal pivoting order for the solution of sparse systems of equationsIEEE Transactions on Circuits and Systems, 1974
- Toward Characterization of Perfect Elimination DigraphsSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- On Optimal-Pivoting Algorithms in Sparse MatricesIEEE Transactions on Circuit Theory, 1972
- The Sparse Tableau Approach to Network Analysis and DesignIEEE Transactions on Circuit Theory, 1971
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Some results on sparse matricesMathematics of Computation, 1970
- The Elimination form of the Inverse and its Application to Linear ProgrammingManagement Science, 1957