A New Algorithm For Generating Minimal Cut Sets In K-Out-Of-N Networks

Yeh, W

A New Algorithm For Generating Minimal Cut Sets In K-Out-Of-N Networks

Yeh, W

Permalink

Publisher:: Elsevier Sci Ltd
Publication Type:: Journal Article
Citation:: Reliability Engineering & System Safety, 2006, 91 (1), pp. 36 - 43
Issue Date:: 2006-01

Closed Access

	Filename	Description	Size
	2010004118OK.pdf		177.89 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Yeh, W	en_US
dc.date.issued	2006-01	en_US
dc.identifier.citation	Reliability Engineering & System Safety, 2006, 91 (1), pp. 36 - 43	en_US
dc.identifier.issn	0951-8320	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15438
dc.description.abstract	Evaluating the network reliability is an important topic in the planning, designing, and control of systems. A k-out-of-n network is a special network in that some nodes must receive at least k (> 1) flows from all of their input edges (n). In real-life	en_US
dc.publisher	Elsevier Sci Ltd	en_US
dc.relation.ispartof	Reliability Engineering & System Safety	en_US
dc.relation.isbasedon	10.1016/j.ress.2004.11.020	en_US
dc.subject.classification	Strategic, Defence & Security Studies	en_US
dc.title	A New Algorithm For Generating Minimal Cut Sets In K-Out-Of-N Networks	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	91	en_US
utslib.location.activity	ISI:000232788000004	en_US
utslib.for	0913 Mechanical Engineering	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	09 Engineering	en_US
utslib.for	15 Commerce, Management, Tourism and Services	en_US
dc.location.activity	ISI:000232788000004	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
pubs.organisational-group	/University of Technology Sydney/Strength - AAI - Advanced Analytics Institute Research Centre
utslib.copyright.status	closed_access
pubs.consider-herdc	false	en_US
pubs.issue	1	en_US
pubs.volume	91	en_US

Abstract:

Evaluating the network reliability is an important topic in the planning, designing, and control of systems. A k-out-of-n network is a special network in that some nodes must receive at least k (> 1) flows from all of their input edges (n). In real-life

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/15438