Accession Number : ADA136900
Title : Efficient Computation of the K-Terminal Reliability of Directed Acyclic Networks.
Descriptive Note : Master's thesis,
Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Personal Author(s) : Chan,L
PDF Url : ADA136900
Report Date : Sep 1983
Pagination or Media Count : 48
Abstract : This thesis describes several topological reduction and decomposition techniques developed to decrease the complexity of computing K-terminal reliability of an acyclic directed network with independent component failures. A program using these techniques has been coded in FORTRAN and tested on complete acyclic graphs and street networks with up to 100 vertices.
Descriptors : *Computations, *Reliability(Electronics), *Communications networks, Communication terminals, Sources, Failure(Electronics), Efficiency, Fortran, Data reduction, Topology, Decomposition, Algorithms, Theses
Subject Categories : Theoretical Mathematics
Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE