Optimum tearing in large scale systems and minimum feedback cutsets of a digraph

DOI10.1016/0016-0032(79)90024-3zbMath0406.93018OpenAlexW1989203112MaRDI QIDQ1257860

Bharat Kinariwala, Kabekode V. S. Bhat

Publication date: 1979

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(79)90024-3

zbMATH Keywords

DigraphLarge Scale SystemsMinimum Feedback CutsetsOptimum Tearing

Mathematics Subject Classification ID

Algebraic methods (93B25) Large-scale systems (93A15)

Related Items

Degree switching operations in networks and large scale systems assignment problems

Cites Work

• A graph theoretic approach to matrix inversion by partitioning
• Theory of Output Set Assignments and Degree Switching Operations
• Enumeration of the Elementary Circuits of a Directed Graph
• Partitioning and Tearing Systems of Equations
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item