A Simple Universal Generating Function Method To Search For All Minimal Paths In Networks

Yeh, W

A Simple Universal Generating Function Method To Search For All Minimal Paths In Networks

Yeh, W

Permalink

Publisher:: IEEE-Inst Electrical Electronics Engineers Inc
Publication Type:: Journal Article
Citation:: IEEE Transactions on Systems, Man and Cybernetics (Part A), 2009, 39 (6), pp. 1247 - 1254
Issue Date:: 2009-01

Closed Access

	Filename	Description	Size
	2010004097OK.pdf		407.98 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	2009-01	en_US
dc.identifier.citation	IEEE Transactions on Systems, Man and Cybernetics (Part A), 2009, 39 (6), pp. 1247 - 1254	en_US
dc.identifier.issn	1083-4427	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15072
dc.description.abstract	Evaluating network reliability is an important topic in planning, designing, and control of systems, and the minimal-path (MP) set is one of the fundamental tools for evaluating network reliability. A straightforward and simple algorithm is presented her	en_US
dc.publisher	IEEE-Inst Electrical Electronics Engineers Inc	en_US
dc.relation.ispartof	IEEE Transactions on Systems, Man and Cybernetics (Part A)	en_US
dc.relation.isbasedon	10.1109/TSMCA.2009.2026209	en_US
dc.rights	© 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	A Simple Universal Generating Function Method To Search For All Minimal Paths In Networks	en_US
dc.type	Journal Article
utslib.citation.volume	6	en_US
utslib.citation.volume	39	en_US
utslib.location.activity	ISI:000270947600010	en_US
utslib.for	0899 Other Information and Computing Sciences	en_US
utslib.for	08 Information and Computing Sciences	en_US
utslib.for	09 Engineering	en_US
dc.location.activity	ISI:000270947600010	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	6	en_US
pubs.volume	39	en_US

Abstract:

Evaluating network reliability is an important topic in planning, designing, and control of systems, and the minimal-path (MP) set is one of the fundamental tools for evaluating network reliability. A straightforward and simple algorithm is presented her

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

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