Show simple item record

dc.contributor.advisorVan Vuuren, J. H.
dc.contributor.authorBinneman, Francois J. A.en_ZA
dc.contributor.otherUniversity of Stellenbosch. Faculty of Economic and Management Sciences. Dept. of Logistics.
dc.date.accessioned2007-11-12T06:24:29Zen_ZA
dc.date.accessioned2010-06-01T08:36:04Z
dc.date.available2007-11-12T06:24:29Zen_ZA
dc.date.available2010-06-01T08:36:04Z
dc.date.issued2007-03
dc.identifier.urihttp://hdl.handle.net/10019.1/1906
dc.descriptionThesis (MSc (Logistics)--University of Stellenbosch, 2007.
dc.description.abstractThere exists, for any connected graph G, a minimum set of vertices that, when removed, disconnects G. Such a set of vertices is known as a minimum cut-set, the cardinality of which is known as the connectivity number k(G) of G. A connectivity preserving [connectivity reducing, respectively] spanning subgraph G0 ? G may be constructed by removing certain edges of G in such a way that k(G0) = k(G) [k(G0) < k(G), respectively]. The problem of constructing such a connectivity preserving or reducing spanning subgraph of minimum weight is known to be NP–complete. This thesis contains a summary of the most recent results (as in 2006) from a comprehensive survey of literature on topics related to the connectivity of graphs. Secondly, the computational problems of constructing a minimum weight connectivity preserving or connectivity reducing spanning subgraph for a given graph G are considered in this thesis. In particular, three algorithms are developed for constructing such spanning subgraphs. The theoretical basis for each algorithm is established and discussed in detail. The practicality of the algorithms are compared in terms of their worst-case running times as well as their solution qualities. The fastest of these three algorithms has a worst-case running time that compares favourably with the fastest algorithm in the literature. Finally, a computerised decision support system, called Connectivity Algorithms, is developed which is capable of implementing the three algorithms described above for a user-specified input graph.en
dc.format.extent1692963 bytesen_ZA
dc.format.mimetypeapplication/pdfen_ZA
dc.language.isoen
dc.publisherStellenbosch : University of Stellenbosch
dc.subjectDissertations -- Logisticsen
dc.subjectTheses -- Logisticsen
dc.subjectReliability (Engineering)en
dc.subjectRedundancy (Engineering)en
dc.subjectGraph theoryen
dc.subjectNetwork reliabilityen
dc.subjectConnectivity algorithmsen
dc.titleNetwork reliability as a result of redundant connectivityen
dc.typeThesis
dc.rights.holderUniversity of Stellenbosch
 Find Full text

Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record