An efficient heuristic cluster algorithm for tearing large-scale networks
- 1 December 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 24 (12), 709-717
- https://doi.org/10.1109/tcs.1977.1084298
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Computational Complexity of Combinatorial and Graph-Theoretic ProblemsPublished by Springer Nature ,2011
- Input-output stability theory of interconnected systems using decomposition techniquesIEEE Transactions on Circuits and Systems, 1976
- Diakoptic and generalized hybrid analysisIEEE Transactions on Circuits and Systems, 1976
- A two levels algorithm for tearingIEEE Transactions on Circuits and Systems, 1976
- Heuristic Programming as an Aid to Network DesignNetworks, 1975
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Sparsity-Directed Decomposition for Gaussian Elimination on MatricesIEEE Transactions on Power Apparatus and Systems, 1970
- On the Decomposition of Networks in Minimally Interconnected SubnetworksIEEE Transactions on Circuit Theory, 1969
- The Use of Linear Graphs in Gauss EliminationSIAM Review, 1961