首页 | 本学科首页   官方微博 | 高级检索  
     


Enumeration of minimal cutsets from matrix representation of directed/undirected networks
Authors:SK Ghosh  Brijendra Singh
Abstract:This paper describes an algorithm for finding the minimal cutsets between a specified source and terminal nodes of directed/undirected networks. Adjacent nodes of a source node/merged node are determined by the collection of node numbers of columns corresponding to non-zero elements of the first row of the adjacency matrix to form the reduced adjacency matrix (RAM) corresponding to merged nodes. Connectivity of RAM has been checked to obtain the minimal cutsets.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号