Search For Minimal Paths In Modified Networks

Yeh, W

Search For Minimal Paths In Modified Networks

Yeh, W

Permalink

Publisher:: Elsevier Sci Ltd
Publication Type:: Journal Article
Citation:: Reliability Engineering & System Safety, 2002, 75 (3), pp. 389 - 395
Issue Date:: 2002-01

Closed Access

	Filename	Description	Size
	2010004137OK.pdf		120.33 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	2002-01	en_US
dc.identifier.citation	Reliability Engineering & System Safety, 2002, 75 (3), pp. 389 - 395	en_US
dc.identifier.issn	0951-8320	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15458
dc.description.abstract	The problem of searching for all minimal paths (MPs) in a network obtained by modifying the original network, e.g. for network expansion or reinforcement, is discussed and solved in this study. The existing best-known method to solve this problem was a s	en_US
dc.publisher	Elsevier Sci Ltd	en_US
dc.relation.ispartof	Reliability Engineering & System Safety	en_US
dc.relation.isbasedon	10.1016/S0951-8320(01)00128-4	en_US
dc.subject.classification	Strategic, Defence & Security Studies	en_US
dc.title	Search For Minimal Paths In Modified Networks	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	75	en_US
utslib.location.activity	ISI:000174658700011	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:000174658700011	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	3	en_US
pubs.volume	75	en_US

Abstract:

The problem of searching for all minimal paths (MPs) in a network obtained by modifying the original network, e.g. for network expansion or reinforcement, is discussed and solved in this study. The existing best-known method to solve this problem was a s

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

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