Optimum tearing in large scale systems and minimum feedback cutsets of a digraph
Authors:
- Kabekode V.S. BhatKBKabekode V.S. Bhat
- Bharat KinariwalaBKBharat Kinariwala
- 1 February 1979
- journal article
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 307 (2) , 83-94
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The bordered triangular matrix and minimum essential sets of a digraphIEEE Transactions on Circuits and Systems, 1974
- An indirect method for minimal essential setsIEEE Transactions on Circuits and Systems, 1974
- Enumeration of the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- A note on minimal essential setsIEEE Transactions on Circuit Theory, 1971
- On the Determination of Minimum Feedback Arc and Vertex SetsIEEE Transactions on Circuit Theory, 1968
- Minimum Feedback Arc and Vertex Sets of a Directed GraphIEEE Transactions on Circuit Theory, 1966
- Minimum Feedback Arc Sets for a Directed GraphIEEE Transactions on Circuit Theory, 1963
- A graph theoretic approach to matrix inversion by partitioningNumerische Mathematik, 1962
- The Theory of NetsIEEE Transactions on Electronic Computers, 1957