A Simple Heuristic Algorithm For Generating All Minimal Paths

IEEE-Inst Electrical Electronics Engineers Inc
Publication Type:
Journal Article
IEEE Transactions On Reliability, 2007, 56 (3), pp. 488 - 494
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010004111OK.pdf267.95 kB
Adobe PDF
Evaluating network reliability is an important topic in the planning, designing, and control of network systems. In this paper, an intuitive heuristic algorithm is developed to find all minimal paths (NIP) by adding a path, or an edge into a network repe
Please use this identifier to cite or link to this item: