Enumeration of minimal cutsets of an undirected graph-Reference-Cited by-同舟云学术

Enumeration of minimal cutsets of an undirected graph

Published:1990-01 Issue:1 Volume:30 Page:23-26
ISSN:0026-2714
Container-title:Microelectronics Reliability
language:en
Short-container-title:Microelectronics Reliability

Author:

Ahmad S.Hasanuddin

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Surfaces, Coatings and Films,Safety, Risk, Reliability and Quality,Condensed Matter Physics,Atomic and Molecular Physics, and Optics,Electronic, Optical and Magnetic Materials

Reference10 articles.

1. A simple technique for computing network reliability;Ahmad;IEEE Trans. Reliab.,1982

2. Calculations of systems unreliability by algebraic manipulation of failure event;Ahmad,1986

3. Enumeration of all minimal cutsets for a node pair in a graph;Arunkumar;IEEE Trans. Reliab.,1979

4. An implicit enumeration scheme for proper cut generation;Bellmore;Technometrics,1970

5. A new technique in minimal path and cutset evaluation;Jasmon;IEEE Trans. Reliab.,1985

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reliability Analysis of Interdependent Stochastic-Flow Networks;2024 Annual Reliability and Maintainability Symposium (RAMS);2024-01-22

2. Applying metamorphic testing to reliability calculating programs;2023 IEEE 28th Pacific Rim International Symposium on Dependable Computing (PRDC);2023-10-24

3. Forming the Telecommunication Networks’ Cross-Sections to Analyze the Latter Stability with Different Connectivity Measures;Informatics and Automation;2021-03-30

4. Probabilistic Security for Multirobot Systems;IEEE Transactions on Robotics;2021-02

5. Cut Sets Enumeration;Network Reliability;2016-08-08