Optimum tearing in large scale systems and minimum feedback cutsets of a digraph
β Scribed by Kabekode V.S. Bhat; Bharat Kinariwala
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 822 KB
- Volume
- 307
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we consider the problem of finding a minimum number of nonzero elements of a given n x n matrix on removal of which the resulting matrix can be permuted to an n x n lower triangular matrix using symmetric permutations on the rows and columns of the matrix. The problem is related to finding a minimum feedback cutset for the digraph of the matrix. A topological method for finding a minimum feedback cutset for a given digraph is presented. Possible extensions to our work are indicated.
π SIMILAR VOLUMES
A large computer system was designed and established for molecular science under the leadership of molecular scientists. Features of the computer system are an automated operation system and an open self-service system. Large-scale theoretical calculations have been performed to solve many problems
The SAR70 program has been written as a tool within the SAR design method for supports. A support is a building in which a variety of floorplans for dwellings can hc made. The design method allows evaluation of such asupport. SAR7O can be used to generate all variations possible within a support str