A revised layered-net work algorithm to search for all d-minpaths of a limited-flow acyclic network

134Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many real-world systems are multistate and composed of multistate components in which the reliability can be computed in terms of the lower bound points of level d, called

Cite

CITATION STYLE

APA

Yeh, W. C. (1998). A revised layered-net work algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Transactions on Reliability, 47(4), 436–442. https://doi.org/10.1109/24.756087

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free