Minimal pathset and minimal cutsets using search technique

Bansal, V. K. ; Misra, K. B. ; Jain, M. P. (1982) Minimal pathset and minimal cutsets using search technique Microelectronics Reliability, 22 (6). pp. 1067-1075. ISSN 0026-2714

Full text not available from this repository.

Official URL:

Related URL:


Application of graph theory to reliability analysis was first made in 1970. Over the years, a large number of computer programmes have been developed to determine the spanning trees, the minimal paths and cutsets, which are essential for determining the reliability of the network. In recent years, there has been an interest in developing small desk top calculators for specific purposes, which could be used by the designers of transportation systems, communication systems, etc. In this article the authors present an approach to design a microprocessor based equipment to determine minimal pathset and minimal cutset from the incidence matrix of the graph. The authors have presented a new design approach, based on search technique. The salient feature of the new approach is a novel tracing process in which the desired graph is traced by operating a set of constraints. The new design approach has already been used by the authors to develop a microprocessor based spanning tree generator.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
ID Code:19988
Deposited On:20 Nov 2010 15:12
Last Modified:07 Jun 2011 06:50

Repository Staff Only: item control page