Efficient Computation of the K-Terminal Reliability of Directed Acyclic Networks.
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
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.
- Theoretical Mathematics
- Computer Programming and Software
- Computer Systems
- Non-Radio Communications