Skip to Main Content
A heuristic algorithm for solving a network partitioning problem associated with the tearing of a directed or undirected graph is presented using the concept of partitioning the fundamental loop matrix for an a priori chosen tree. Experimental results are given and they show that the proposed algorithm is very effective and yields an optimal, or near optimal, solution.
Electronic Circuits and Systems, IEE Proceedings G (Volume:131 , Issue: 5 )
Date of Publication: October 1984