The bordered triangular matrix and minimum essential sets of a digraph
- 1 September 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 21 (5), 633-639
- https://doi.org/10.1109/tcs.1974.1083911
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A note on minimal and quasi-minimal essential sets in complex directed graphsIEEE Transactions on Circuit Theory, 1972
- The Role of Partitioning in the Numerical Solution of Sparse SystemsPublished by Springer Nature ,1972
- A note on minimal essential setsIEEE Transactions on Circuit Theory, 1971
- The Sparse Tableau Approach to Network Analysis and DesignIEEE Transactions on Circuit Theory, 1971
- Sparsity-Directed Decomposition for Gaussian Elimination on MatricesIEEE Transactions on Power Apparatus and Systems, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- On the Determination of Minimum Feedback Arc and Vertex SetsIEEE Transactions on Circuit Theory, 1968
- The Inversion of Sparse Matrices by a Strategy Derived from their GraphsThe Computer Journal, 1967
- Minimum Feedback Arc and Vertex Sets of a Directed GraphIEEE Transactions on Circuit Theory, 1966
- The Theory of NetsIEEE Transactions on Electronic Computers, 1957