Referenced Items are not available for this document.
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.
Published in:
Electronic Circuits and Systems, IEE Proceedings G
(Volume:131
,
Issue:
5
)
Date of Publication: October 1984
- Page(s):
- 203 - 208
- ISSN :
- 0143-7089
- Digital Object Identifier :
- 10.1049/ip-g-1:19840038
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 11 November 2008
- Issue Date :
- October 1984
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
