A memory efficient algorithm for network reliability

A memory efficient algorithm for network reliability

We combine the Augmented Ordered Binary Decision Diagram (OBDD-A) with the use of boundary sets to create a method for computing the exact K-terminal or all-terminal reliability of an undirected network with failed edges and perfect vertices. We present the results of implementing this algorithm and...

Full description

Bibliographic Details
Main Authors: Herrmann, Johannes, Soh, Sieteng
Other Authors: na
Format: Conference Paper
Published: IEEE explore 2009
Subjects:
binary decision diagram
network - reliability
K-terminal reliability
all-terminal reliability
space - efficient. - I
boundary set
Online Access:http://hdl.handle.net/20.500.11937/27346

Internet

http://hdl.handle.net/20.500.11937/27346

Similar Items